EFFECTIVENESS MULTI-LEVEL HASH-MEMORY ORGANIZATION

Authors

  • Oleksandr Markovskyi National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", Ukraine
  • Abbasi Shagin National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", Ukraine
  • Viktoriia Maksymuk National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", Ukraine

Keywords:

addressing collign, hash-retrieval, hash-memory

Abstract

In paper an approach for increasing effectiveness of organization of multi-level hash-memory for rapid retrieval by key. Upper level of such hash-memory is retrieval buffer in cash memory unit and low level is in main memory. The peculiarities of researched hash-memory organization cocsist of near-permanent characters of key array. It means that intensively of retrieval operation by few order is height in compare to operations connected with key change.  The probabilistic model of hash-searching in near-permanent keys arrays which are storages in two-level memory has been developed. On the base of this model the effectiveness organization of hash-access to information has been proposed. It has been shown that proposed hash-access organization requires  ensure no more then one access to slow low-level memory.    

Key words:  hash-memory, hash-retrieval, addressing collign.  

Bibl.: 2

References

Марковский А.П. Хеш-память с ограниченным временем поиска по ключу/ А.П. Марковский, Е.В. Порхун, А.В. Мнацаканов // Вісник НТУУ “КПІ”. Інформатика, управління та обчислювальна техніка.- 2008,- № 49,- C.156-162.

Марковський О.П., Максимук В.Р. Організація мультиадресації в хеш-

пам’яті // Збірник тез доповідей 9-ї наукової конференції Прикладна

математика та комп’ютинг ПМК-2017. Київ 19-21 квітня 2017. – К.:Просвіта,

– С.195-199.

Published

2023-11-08

Issue

Section

Security, Fault Tolerance