The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1984 vol.33)
pp: 851-855
ABSTRACT
Two parallel hashing algorithms based on open and chained hashing are discussed. The parallel chained hashing algorithm is efficient even in the environment where deletion and insertion frequently occur. The chained hashing memory with fewer memory banks has a performance equivalent to that of the open hashing memory.
INDEX TERMS
parallel hashing, Associative memory, hashing hardware
CITATION
K. Nishida, T. Shimada, "Evaluation of Associative Memory Using Parallel Chained Hashing", IEEE Transactions on Computers, vol.33, no. 9, pp. 851-855, September 1984, doi:10.1109/TC.1984.1676502
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool