Abstract
In this paper we consider the relationship between algorithms and parallel VLSI architectures. Starting from the premise that VLSI is the natural habitat for parallel algorithmics, we outline the desirable features of VLSI architectures. Next we discuss the notion of algorithmic paradigm, as the data transfer pattern of a class of specific algorithms. The recursive combination paradigm (applicable to merging, sorting, FFT, permutation, etc.), is naturally mapped to the awkward binary cube architecture. Thus we analyze four viable architectures — the shuffle-exchange, the linear array, the mesh, and the cube-connected-cycles — which emulate the binary cube. Finally, we illustrate the mechanisms of pipelining, pleating, and mixing, which play a significant role in matching algorithms and architectures.
This work has been supported in part by the National Science Foundation under Grant MCS-81-05552.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
R. P. Brent and H. T. Kung, "The chip complexity of binary arithmetic," Journal of the ACM, vol. 28, n. 3, pp. 521–534, July 1981.
C. D. Thompson, "Area-time complexity for VLSI," Proc. of the 11th Annual ACM Symposium on the Theory of Computing (SIGACT), pp. 81–88, May 1979.
J. E. Vuillemin, "A combinatorial limit to the computing power of VLSI circuits," IEEE Transactions on Computers, C-32, n. 3, pp. 294–300, March 1983.
F. P. Preparata and J. Vuillemin, "The cube-connected-cycles: a versatile network for parallel computation," Communications of the ACM, vol. 24, n. 5, pp. 300–309, May 1981.
F. P. Preparata and J. Vuillemin, "Area-time optimal VLSI networks for computing integer multiplication and Discrete Fourier Transform," Proc. of I.C.A.L.P., Acre, Israel, pp. 29–40, June 1981.
H. S. Stone, "Parallel processing with the perfect shuffle," IEEE Transactions on Computers, C-20, n. 2, pp. 153–161, February 1971.
D. Kleitman, et al., "An asymptotically optimal layout for the shuffle-exchange graph," J. of Comp. and Syst. Sci., vol. 26, n. 3, pp. 339–361, June 1983.
F. P. Preparata and J. Vuillemin, "Area-time optimal VLSI network for multiplying matrices," Information Processing Letters, vol. 11, n. 2, pp. 77–80, October 1980.
G. Bilardi and F. P. Preparata, "An architecture for bitonic sorting with optimal VLSI performance," IEEE Transactions on Computers, to appear (May 1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Preparata, F.P. (1984). VLSI algorithms and architectures. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030295
Download citation
DOI: https://doi.org/10.1007/BFb0030295
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive