Home → Magazine Archive → July 1982 (Vol. 25, No. 7) → Searching in a dynamic memory with fast sequential... → Abstract

Searching in a dynamic memory with fast sequential access

By Om Vikas, V. Rajaraman

Communications of the ACM, Vol. 25 No. 7, Pages 479-484

This communication presents an algorithm for searching in the Aho-Ullman dynamic memory consisting of (2m - 1) cells. Mean search time of 1.5m steps to the first specified record is obtained with a subsequent sequential access capability. Thus, in such a dynamic memory, the mean access time for content addressing is the same as the mean access time for random addressing.

The full text of this article is premium content


No entries found