This Article 
 Bibliographic References 
 Add to: 
A Generalized Simultaneous Access Dictionary Machine
April 1991 (vol. 2 no. 2)
pp. 149-159

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.

[1] M. J. Atallah and S. R. Kasaraju, "A generalized dictionary machine for VLSI,"IEEE Trans. Comput., vol. C-34, no. 2, pp. 151-155, 1985.
[2] J. Bentley and H. Kung, "A tree machine for searching problems," inProc. Int. Conf. Parallel Processing, 1979, pp. 265-266.
[3] G. Bilardi and F. P. Preparata, "A minimum area VLSI network forO(logn) time sorting,"IEEE Trans. Comput., vol. C-34, no. 4, Apr. 1985.
[4] M. Carey and C. Thompson, "An efficient implementation of search trees on [logN+ 1] processors,"IEEE Trans. Comput., vol. C-33, no. 11, pp. 1038-1041, 1984.
[5] K.H. Cheng, "A simultaneous access queue,"J. Parallel Distributed Comput., vol. 9, no. 1, pp. 83-86, 1990.
[6] C. S. Ellis, "Concurrent search and insertion in 2-3 trees,"Acta Informatica, vol. 14, pp. 63-86, 1980.
[7] C. S. Ellis, "Concurrent search and insertion in AVL-trees,"IEEE Trans. Comput., vol. C-29, no. 9, pp. 811-817, 1980.
[8] Z. Fan and K.H. Cheng, "Design and analysis of simultaneous access priority queues,"J. Parallel Distributed Comput., vol. 9, no. 4, pp. 387-397, 1990.
[9] Z. Fan and K.H. Cheng, "A simultaneous access dictionary machine,"Parallel Comput., Tech. Rep. UH-CS-89-02, Feb. 1989, 20 pp.
[10] A. Gottlieb, B. D. Lubachevsky, and L. Rudolph, "Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors,"ACM Trans. Programming Languages Syst., vol. 5, no. 2, pp. 164-189, Apr. 1993.
[11] E. Horowitz and S. Sahni,Fundamentals of Data Structures.Rockville, MD: Computer Science Press, 1984.
[12] H.T. Kung and J.T. Lehman, "Concurrent Manipulation of Binary Search Trees,"ACM Trans. Database Systems, Sept. 1980, pp. 354-382.
[13] F. T. Leighton,Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Lower Bound Techniques for VLSI. Cambridge, MA: M.I.T. Press, 1983.
[14] C. E. Leiserson, "Systolic priority queues," inProc. Caltech Conf. VLSI, 1979, pp. 200-214.
[15] H.F. Li and D.K. Probst, "Optimal VLSI dictionary machines without compress instructions,"IEEE Trans. Comput., vol. C-39, no. 5, pp. 676-693, May 1990.
[16] D. Nassimi and S. Sahni, "A self-routing Benes network and parallel permutation algorithms,"IEEE Trans. Comput., vol. C-30, no. 5, pp. 332-340, May 1981.
[17] D. Nassimi and S. Sahni, "Parallel permutation and sorting algorithms and a new generalized connection network,"J. ACM, vol. 29, no. 3, pp. 642-667, 1982.
[18] T. A. Ottmann, A. L. Rosenberg, and L. J. Stockmeyer, "A dictionary machine (for VLSI),"IEEE Trans. Comput., vol. C-31, no. 9, pp. 892-897, 1982.
[19] F. P. Preparata, "New parallel sorting scheme,"IEEE Trans. Comput., vol. C-27, no. 7, pp. 669-673, 1978.
[20] A.M. Schwartz and M. C. Loui, "Dictionary machines on cube-class networks,"IEEE Trans. Comput., vol. C-36, no. 1, pp. 100-105, 1987.
[21] A. K. Somani and V. K. Agarwal, "An efficient unsorted VLSI dictionary machine,"IEEE Trans. Comput., vol. C-34, pp. 841-852, Sept. 1985.
[22] H. S. Stone. "Parallel processing with perfect shuffle."IEEE Trans. Comput., vol. C-20, no. 2, pp. 153-161, 1971.
[23] J. D. Ullman,Computational Aspects of VLSI.Rockville, MD: Computer Science Press, 1984.

Index Terms:
Index Termssimultaneous access; dictionary machine; redundant accesses; search operations;bottleneck; multiprocessor system; data structures; parallel architectures
Z. Fan, K.H. Cheng, "A Generalized Simultaneous Access Dictionary Machine," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 2, pp. 149-159, April 1991, doi:10.1109/71.89061
Usage of this product signifies your acceptance of the Terms of Use.