This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Dictionary Machine Using Hexagonal Processor Arrays
March 1996 (vol. 7 no. 3)
pp. 266-273

Abstract—Dictionary machine is an important VLSI system performing high speed data archival operations. In this paper, we present a design which can efficiently implement dictionary machines in VLSI processor arrays. In order to effectively process the operations of dictionary machine, hexagonal mesh is selected as the host topology in which two different networks for update and query operation are embedded. The proposed design is simple to implement as well as allows high throughput.

[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 a small number of processors," Proc. 11th Annual Int'l Symp. Conputer Architecture, pp. 151-156, 1984.
[8] A.K. Somani,V.K. Agrawal., “An efficient unsorted VLSI dictionary machine.” IEEE Trans. Computers, vol. 34, 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 for VLSI,” IEEE Trans. Computers, vol. 40, no. 7, pp. 882-890, July 1991.

Index Terms:
Dictionary machine, edge disjoint embedding, hexagonal mesh, processor array, update and query.
Citation:
Hee Yong Youn, Jae Young Lee, "An Efficient Dictionary Machine Using Hexagonal Processor Arrays," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 3, pp. 266-273, March 1996, doi:10.1109/71.491580
Usage of this product signifies your acceptance of the Terms of Use.