Issue No. 05 - May (1985 vol. 34)
H. Schmeck , Institut f?r Informatik und Praktische Mathematik, Christian-Albrechts-Universit?
VLSI hardware models, Dictionary machines. are taken as an example to demonstrate the implications the choice of the VLSI hardware model has on the design and analysis of algorithms and special purpose architectures. A systolic search tree and a two-dimensional systolic array are used to implement the dictionary machine. If the wire lengths only affect the area, the systolic search tree suggests itself as an efficient realization of a dictionary machine having constant period, linear areS, and logarithmic execution t, Algorithms for VLSI, dictionary machine, systolic array, systolic search tree, VLSI complexity
H. Schmeck, H. Schroder, "Dictionary Machines for Different Models of VLSI", IEEE Transactions on Computers, vol. 34, no. , pp. 472-475, May 1985, doi:10.1109/TC.1985.1676587