Issue No. 02 - April (1991 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.89061
<p>A simultaneous access design of a dictionary machine which supports insert, delete, andsearch operations is presented. The design is able to handle p accesses simultaneouslyand allows redundant accesses to occur. In the design, processors performing insert ordelete operations are free to perform other tasks after submitting their accesses to thedesign; processors that perform search operations get their response in O(log N) time.Compared to all sequential access designs of a dictionary which require O(p) time toprocess p accesses, the presented design provides much higher throughput; specifically,O(p/log p) times better. It also provides a fast mechanism to avoid the sequential accessbottleneck in any large multiprocessor system.</p>
Index Termssimultaneous access; dictionary machine; redundant accesses; search operations;bottleneck; multiprocessor system; data structures; parallel architectures
Z. Fan and K. Cheng, "A Generalized Simultaneous Access Dictionary Machine," in IEEE Transactions on Parallel & Distributed Systems, vol. 2, no. , pp. 149-159, 1991.