Dictionary Machines on Cube-Class Networks

A dictionary is a data structure that supports insertion, deletion, and retrieval operations. To maintain a database, a dictionary machine accepts an arbitrary sequence of instructions at a constant rate. We designed two new VLSI dictionary machines on general-purpose networks that emulate the binary cube. One machine runs on a shuffle-exchange network. It includes a novel architecture to implement pipelining of dictionary instructions. The other machine runs on a cube-connected-cycles network. The design of this machine relies on the existence of a Hamiltonian path, which we establish explicitly for every cube-connected-cycle network.

[1]  Allan L. Fisher.  Dictionary machines with a small number of processors , 1984, ISCA 1984.

[2]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[3]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[4]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[6]  Mikhail J. Atallah,et al.  A Generalized Dictionary Machine for VLSI , 1985, IEEE Transactions on Computers.

[7]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[8]  Charles E. Leiserson.  Systolic Priority Queues , 1979 .

[9]  Charles E. Leiserson,et al.  Optimizing synchronous systems , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[11]  Arnold L. Rosenberg,et al.  A Dictionary Machine (for VLSI) , 1982, IEEE Transactions on Computers.

[12]  Arun K. Somani,et al.  An efficient VLSI dictionary machine , 1984, ISCA 1984.

[13]  N. H. Chein.  EBE: a language for specifying the expected behavior of programs during debugging , 1977 .

[14]  Michael J. Carey,et al.  An Efficient Implementation of Search Trees on [lg N + 1] Processors , 1984, IEEE Transactions on Computers.

[15]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.

[16]  Hartmut Schmeck,et al.  Dictionary Machines for Different Models of VLSI , 1985, IEEE Transactions on Computers.

[17]  Vinod K. Agarwal,et al.  An Efficient Unsorted VLSI Dictionary Machine , 1985, IEEE Transactions on Computers.

[18]  Gary L. Miller,et al.  An Asymptotically Optimal Layout for the Shuffle-Exchange Graph , 1983, J. Comput. Syst. Sci..