Abstract:
This correspondence is concerned with the development of algorithms for special-purpose VLSI arrays. The approach used in this correspondence is to identify algorithm tra...Show MoreMetadata
Abstract:
This correspondence is concerned with the development of algorithms for special-purpose VLSI arrays. The approach used in this correspondence is to identify algorithm transformations which modify favorably the index set and the data dependences, but perserve the ordering imposed on the index set by the data dependences. Conditions for the existance of such transformations are given for a class of algorithms. Also, a methodology is proposed for the synthesis of VLSI algorithms.
Published in: IEEE Transactions on Computers ( Volume: C-31, Issue: 11, November 1982)
References is not available for this document.
Select All
1.
H. T. Kung, "Lets design algorithms for VLSI systems", Proc. Caltech Conf. VLSI, pp. 65-90, 1979-Jan.
2.
H. T. Kung, C. E. Leiserson, C. A. Mead and L. A. Conway, "Systolic arrays for VLSI" in Introduction to VLSI Systems, MA, Reading:Addison-Wesley, 1980.
3.
H. T. Kung, "The structure of parallel algorithms" in Advances in Computers, New York:Academic, vol. 19, pp. 65-111, 1980.
4.
S. Y. Kung, "VLSI array processor for signal processing", Proc. Conf. Advance Res. Integrated Circuits, 1980-Jan.-28-30.
5.
K. Hwang and Y. H. Cheng, "VLSI computing structures for solving large scale linear system of equations", Proc. Parallel Processing Conf., pp. 217-227, 1980.
6.
J. M. Speiser, H. J. Whitehouse and K. Bromley, "Signal processing applications for systolic arrays", Proc. 14th Asilomar Conf. Circuits Syst. Comput., 1980-Nov.
7.
J. G. Nash, S. Hansen and G. R. Nudd, "VLSI processor array for matrix manipulation", Proc. Conf. VLSI Syst., 1981-Oct.
8.
U. Banerjee, "Time and parallel processor bounds for Fortran-like loops", IEEE Trans. Comput., vol. C-28, pp. 660-670, Sept. 1979.
9.
Y. Muraoka, Parallelism exposure and exploitation in programs, Feb. 1971.
10.
D. J. Kuck, Y. Muraoka and S. C. Chen, "On the number of operations simultaneously executable in Fortran-like programs and their resulting speedup", IEEE Trans. Comput., vol. C-21, pp. 1293-1310, Dec. 1972.
11.
L. Lamport, "The parallel execution of DO loops", Commun. ACM, pp. 83-93, Feb. 1974.
12.
R. Towle, Control and data dependence for program transformations, Mar. 1976.
13.
R. H. Kuhn, Optimization and interconnection complexity for: parallel processors single stage networks and decision trees, 1980.
14.
L. J. Mordell, The Diophantine Equations, New York:Academic, pp. 30, 1969.
