An efficient dictionary machine using hexagonal processor arrays

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 3, 1996, Pages 266-273

  Youn, Hee Yong ^a,b   Lee, Jae Young ^b  

^a IEEE

^b The University of Texas at Arlington   (United States)

Author keywords

Dictionary machine; Edge disjoint embedding; Hexagonal mesh; Processor array; Update and query

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; ELECTRIC NETWORK TOPOLOGY; INFORMATION RETRIEVAL SYSTEMS; INTERCONNECTION NETWORKS; LOGIC DESIGN; VLSI CIRCUITS;

DICTIONARY MACHINE; EDGE DISJOINT EMBEDDING; HEXAGONAL PROCESSOR ARRAYS; UPDATE;

SYSTOLIC ARRAYS;

EID: 0030107853     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.491580     Document Type: Article

References (12)

1. M.A. Bonncelli et al., "A VLSI Tree Machine for Relational Data Bases," Proc. 10th Ann. Symp. Computer Architecture, pp. 67-73, June 1983.
2. F. Dehne and N. Santoro, "An Improved New Embedding for VLSI Dictionary Machines on Meshes," Proc. Int'l Symp. Computer Applications in Design, Simulation, and Analysis, pp. 113-116, 1989.
3. T.A. Ottman, A.L. Rosenberg, and L.J. Stockmeyer, "A Dictionary Machine (for VLSI)," IEEE Trans. Computers, vol. 31, no. 9, pp. 892-897, Sept. 1982.
4. M.J. Atallah and S.R. Kosaraju, "A Generalized Dictionary Machine for VLSI," IEEE Trans. Computers, vol. 34, no. 2, pp. 151-155, Feb. 1985.
5. J.L. Bently and H.T. Kung, "A Tree Machine for Searching Problems," Proc. Int'l Conf. Parallel Processing, pp. 257-266, Aug. 1979.
6. M.J. Carey and C.D. Thompson, "An Efficient Implementation of Search Trees on [log N + 1] Processors," IEEE Trans. Computers, vol. 33, no. 11, pp. 1,038-1,041, Nov. 1984.
7. A.L. Fisher, "Dictionary Machines With Small Number of Processors," Proc. Int'l Symp. Computer Architecture, pp. 151-156, June 1984.
8. A.K. Somani and V.K. Agrawal, "An Efficient Unsorted VLSI Dictionary Machine," IEEE Trans. Computers, vol. 34, no. 9, pp. 841-852, Sept. 1985.
9. J.D. Ullman, "Computational Aspects of VLSI," Reading, Mass., CS Press, 1984.
10. H.Y. Youn and A.D. Singh, "On Implementing Large Binary Tree Architectures in VLSI and WSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 526-537, Apr. 1989.
11. F. Dehne and N. Santoro, "Optimal VLSI Dictionary Machines on Meshes," Proc. Int'l Conf. on Parallel Processing, pp. 832-840, Aug. 1987.
12. A.D. Singh and H.Y. Youn, "A Modular Fault-Tolerant Binary Tree Architecture With Short Links," IEEE Trans. Computers, vol. 40, no. 7, pp. 882-890, July 1991.