On Supercomputing with Systolic/Wavefront Array Processors

Proceedings of the IEEE

Volumn 72, Issue 7, 1984, Pages 867-884

  Kung, Sun Yuan ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA-FLOW GRAPH (DFG); HIERARCHICAL INTERACTIVE FLOW GRAPH DESIGN (HIFD); SIGNAL-FLOW GRAPH (SFG); SUPERCOMPUTERS; SYSTOLIC/WAVEFRONT ARRAY PROCESSOR;

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING - ALGORITHMS;

COMPUTER NETWORKS;

EID: 0021455219     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1984.12944     Document Type: Article

References (33)

1. J. Backus, “Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,” Commun. ACM, vol. 21 pp. 613–641, 1978.
2. C. Caraiscos and B. Liu, “From digital filter flow-graphs to systolic arrays, “ submitted to IEEE Trans. Acoust., Speech, Signal Processing, 1984.
3. H. J. Caulfield, W. T. Rhodes, M. J. Foster, and S. Horvitz, “Optical implementation of systolic array processing,” Opt. Commun., vol. 40, pp. 86–90, Dec. 1981.
4. M. Chen and C. Mead, “Concurrent algorithms as space-time recursion equations,” to appear in VLSI and Modern Signal Processing, S. V. Kung et at., Eds., Englewood Cliffs, NJ: Prentice Hall.
5. A. B. Cremers and T. N. Hibbard, “The semantic definition of programming languages in terms of their data spaces,” Infor-matik-Fachberichte, vol. 1, pp. 1–11 ‘Berlin, Springer-Verlag’, 1976.
6. A. B. Cremers and S. Y. Kung, “On programming VLSI concurrent array processors,” in Proc. IEEE Workshop on Languages for Automation ‘Chicago, IL, 1983’, pp. 205–210; also in INTEGRATIONS ‘The VLSI Journal’, vol. 2, no. 1, Mar. 1984.
7. J. B. Dennis, “Data flow supercomputers,” IEEE Computer, vol. 13, pp. 48–56, Nov. 1980.
8. P. Dewilde, personal communication, 1983.
9. J. J. Dongarra et at., LINPACK USER'S GUIDE. Philadelphia, PA: SIAM PUB., 1979.
10. M. Franklin and D. Wann, “Asynchronous and clocked control structures for VLSI based interconnection networks,” presented at the 9th Annual Symp. on Computer Architecture, Apr. 1982, Austin, TX.
11. R. J. Cal-Ezer, “The wavefront array processor,” Ph.D. dissertation, Dept. of Electrical Engineering, University of Southern California, Dec. 1982.
12. J. W. Goodman, F. Leonberger, S. Y. Kung, and R. Athale, “Optical interconnections for VLSI systems,” this issue, pp. 850-866; also prepared as an ARO Palantir Meeting Report.
13. K. Hwang and F. Briggs, Computer Architectures and Parallel Processing. New York: McGraw-Hill, 1984.
14. J. V. Jagadish, T. Kailath, G. G. Mathews, and J. A. Newkirk, “On pipelining systolic arrays,” presented at the 17th Asilomar Conf. on Circuits, Systems, and Computers, Pacific Grove, CA, Nov. 1983, also “On hardware description from block diagrams,” in Proc. IEEE ICASSP ‘San Diego, CA, Mar. 1984’.
15. H. T. Kung, “Why systolic architectures,” IEEE Computer, vol. 15, no. 1, Jan. 1982.
16. H. T. Kung and C. E. Leiserson, “Systolic arrays ‘for VLSI’,” in Proc. Sparse Matrix Symp. ‘SIAM’, pp. 256-282, 1978.
17. S. Y. Kung, K. S. Arun, R. J. Gal-Ezer, and D. V. Bhaskar Rao, “Wavefront array processor: Language, architecture, and applications,” IEEE Trans. Comput. ‘Special Issue on Parallel and Distributed Computers’, vol. C-31, no. 11, pp. 1054–1066, Nov. 1982.
18. S. Y. Kung and R. J. Gal-Ezer, “Synchronous vs. asynchronous computation in VLSI array processors,” in Proc. SPIE Conf. ‘Arlington, VA’, 1982.
19. S. Y. Kung and J. Annevelink, “VLSI design for massively parallel signal processors,” Microprocessors and Microsystems ‘Special Issue on Signal Processing Devices’, vol. 7, no. 4, pp. 461–468, Dec. 1983.
20. S. Y. Kung, “From transversal filter to VLSI wavefront array,” in Proc. Int. Conf. on VLSI 1983, IFIP ‘Trondheim, Norway’, 1983.
21. S. Y. Kung and R. J. Gal-Ezer, “Eigenvalue, singular value and least square solvers via the wavefront array processor,” in Algorithmically Specialized Computer Organizations, L. Snyder et al., Eds. New York: Academic Press, 1983.
22. C. E. Leiserson, “Area-efficient VLSI computation,” Ph.D. dissertation, Carnegie-Mellon University, Pittsburgh, PA, Oct. 1981.
23. C. E. Leiserson, F. M. Rose, and J. B. Saxe, “Optimizing synchronous circuitry by retiming,” in Proc. Caltech VLSI Conf. ‘Pasadena, CA’, 1983.
24. C. E. Leiserson and J. B. Saxe, “Optimizing synchronous systems,” J. VLSI Comput. Syst., vol. 1, no. 1, pp. 41–67, 1983.
25. H. Lev-Ari, “Modular computing networks: A new methodology for analysis and design of parallel algorithms/architectures,” Tech. Memo ISI-29, Integrated Systems Inc., Palo Alto, Ca„ 1983.
26. C. Mead and L. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
27. A. Oppenheim and R. Schafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
28. D. A. Patterson and C. H. Sequin, “A VLSI RISC,” IEEE Computer, vol. 14, Sept. 1981.
29. B. T. Smith ef al., Matrix Eigensystem Routines, EISPACK Guide, vol. 6 of Lecture Notes in Computer Science, 2nd ed. New York: Springer-Verlag, 1976.
30. J. D. Ullman, Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
31. A. Fettweis, “Readability of digital filter networks,” AEU ‘Electronics and Communication’, vol. 30, pp. 90–96, 1976.
32. H. T. Kung and M. S. Lam, “Fault-tolerant VLSI systolic arrays and two-level pipelining,” in Proc. SPIE Symp., vol. 431, pp. 143–158, Aug. 1983.
33. H. T. Kung and M. S. Lam “Fault-tolerance and two-level pipelining in VLSI systolic arrays,” in Proc. Conf. on Advanced Research in VLSI ‘MIT, Cambridge, MA, Jan. 1984’, pp. 74-83.