Concurrent VLSI Architectures

IEEE Transactions on Computers

Volumn C-33, Issue 12, 1984, Pages 1247-1265

  Seitz, Charles L ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational arrays; concurrent computation; logic enhanced memories; microcomputer arrays; multiprocessors; parallel processing; smart memories; systolic arrays VLSI

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; INTEGRATED CIRCUITS, VLSI;

COMPUTATIONAL ARRAYS; CONCURRENT COMPUTATION; MICROCOMPUTER ARRAYS; SYSTOLIC ARRAYS; VLSI ARCHITECTURES;

COMPUTERS, MICROPROCESSOR;

EID: 0021604998     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1984.1676396     Document Type: Article

References (88)

1. H. Abelson and P. Andreae, “Information transfer and area-time tradeoffs for VLSI multiplication,” Commun. Ass. Comput. Mach., vol. 23, no. 1, pp. 20–23, 1980.
2. I. Barron et al., “Transputer does 5 or more MIPS even when not used in parallel,” Electronics, pp. 109–115, Nov. 17, 1983.
3. K. E. Batcher, “The flip network in STARAN,” in Proc. Int. Conf. Parallel Processing, 1976, pp. 65–71.
4. G. Bilardi, M. Pracchi, and F. P. Preparata, “A critique and an appraisal of VLSI models of computation,” in Proc. CMU Conf. VLSI Syst. Corn-put., 1981. Rockville, MD: Comput. Sci. Press, 1981.
5. G. Bishop and H. Fuchs, “A smart optical sensor on silicon,” in Proc. Conf. Advanced Res. VLSI. Jan. 1984. Dedham, MA: Artech, 1984, pp. 65–73.
6. J. Blackmer, P. Kuekes, and G. Frank, “A 200 MOPS systolic processor,” in Proc. SPIE, vol. 298, Real-Time Signal Processing IV, Soc. Photo-Opt. Instrum. Eng., 1981.
7. R. P. Brent and H. T. Kung, “The chip complexity of binary arithmetic,” in Proc. 12th ACM Symp. Theory Comput., May 1980, pp. 190–200.
8. K. Bromley et al., “Systolic array processor developments,” in Proc. CMU Conf. VLSI Syst. Comput., Oct. 1981. Rockville, MD: Comput. Sci. Press, 1981, pp. 273–284.
9. S. A. Browning, “The tree machine: A highly concurrent computing environment,” Dep. Comput. Sci., California Inst. Technol., Pasadena, Tech Rep. 3760:TR:80, 1980.
10. S. A. Browning, sect. 8.4.1 in C. A. Mead and L. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
11. S. A. Browning and C. L. Seitz, “Communication in a tree machine,” in Proc. 2nd Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol., Pasadena, 1981, 509–526.
12. M. R. Buric and C. Mead, “Bit serial inner product processors in VLSI,” in Proc. 2nd Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol., Pasadena, 1981, pp. 155–164.
13. C. R. Carroll, “A smart memory array processor for two layer path finding,” in Proc. 2nd Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol., Pasadena, 1981, pp. 165–195.
14. D. P. Christman, “Programming the connection machine,” M.S. thesis, Dep. Elec. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, 1984.
15. D. Cohen, “Simplified control of FFT hardware,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-24, Dec. 1976.
16. D. Cohen, “Mathematical approach to iterative computation networks,” in Proc. 4th Symp. Comput. Arithmetic (also as ISI/RR-78-73, U.S.C./Inform. Sci. Inst., Marina del Rey, CA, Nov. 1978), IEEE Cat. No. 78CH1412-6C, pp. 226–238, Oct. 1978.
17. A. L. Davis and R. M. Keller, “Data flow program graphs,” IEEE Computer, vol. 15, pp. 26–41, Feb. 1982.
18. P. B. Denyer, “An introduction to bit-serial architectures for VLSI signal processing,” in VLSI Architecture, B. Randall and P. C. Treieven, Eds. Englewood Cliffs, NJ: Prentice-Hall, 1983, ch. 20.
19. J. T. Deutch and A. R. Newton, “A multiprocessor implementation of relaxation based electrical circuit simulation,” in Proc. 21st Design Automat. Conf, 1984, pp. 350–357.
20. M. Dubois and F. A. Briggs, “Effects of cache coherency in multiprocessors,” IEEE Trans. Comput., vol. C-31, Nov. 1982.
21. A. L. Fisher et al., “The architecture of a programmable systolic chip,” J. VLSI Comput. Syst., vol. 1, no. 2, pp. 1–16, 1984.
22. G. C. Fox and S. W. Otto, “The use of concurrent processors in science and engineering,” Phys. Today, May 1984.
23. H. Fuchs et al., “Developing pixel-planes, a smart memory-based raster graphics system,” in Proc. Conf. Advanced Res. VLSI, Massachusetts Inst. Technol., Cambridge, Jan. 1982. Dedham, MA: Artech, 1982.
24. G. R. Goke and G. J. Lipouski, “Banyan networks for partitioning multiprocessor systems,” in Proc. 1st Annu. Symp. Comput. Architecture, 1973, pp. 21–28.
25. D. E. Heller and I. C. F. Ipsen, “Systolic networks for orthogonal equivalence transformations and their applications,” in Proc. Conf. Advanced Res. VLSI, Massachusetts Inst. Technol., Cambridge, Jan. 1982, Dedham, MA: Artech, 1982, pp. 113–122.
26. G. G. Hendrix, “Encoding knowledge in partitioned networks,” in Association Networks. New York: Academic, 1979.
27. J. L. Hennessy, “VLSI processor architecture,” IEEE Trans. Comput., this issue, pp. 1221–1246.
28. C. E. Hewitt, “The apiary network architecture for knowledgeable systems,” in Conf. Rec. LISP Conf., Stanford, CA, Aug. 1980.
29. W. D. Hillis, “The connection machine (computer architecture for the new wave),” Massachusetts Inst. Technol., Cambridge, Al Memo 646, Sept. 1981.
30. C. A. R. Hoare, “Communicating sequential processes,” Commun. Ass. Comput. Mach., vol. 21, no. 8, pp. 666–677, 1978.
31. B. Hoeneisen and C.A. Mead, “Fundamental limitations in microelectronics I, MOS technology,” Solid-State Electron., vol. 15, pp. 819–829, 1972.
32. L. Johnsson and D. Cohen, “A mathematical approach to modeling the flow of data and control in computational networks,” in Proc. CMU Conf. VLSI Syst. Comput., Oct. 1981. Rockville, MD: Comput. Sci. Press, 1981, 213–225.
33. L. Johnsson, “Computational arrays for band matrix equations,” Dep. Comput. Sci., California Inst. Technol., Pasadena, Tech. Rep. 4287:TR:81, 1981.
34. L. Johnsson, “A computational array for the QR-method,” in Proc. Conf. Advanced Res. VLSI, Massachusetts Inst. Technol., Cambridge, 1982. Dedham, MA: Artech, 1982, pp. 123–129.
35. D. J. Kuck et al., “Measurements of parallelism in ordinary FORTRAN programs,” IEEE Computer, vol. 7, pp. 37–46, Jan. 1974.
36. R. H. Kuhn and D. A. Padua, Eds., IEEE Computer Society Tutorial on Parallel Processing, 1981.
37. H. T. Kung, “Synchronized and asynchronous parallel algorithms for multiprocessors,” in Algorithms and Complexity: New Directions did Recent Results, J. F. Traub, Ed. New York: Academic, 1976, pp. 153–200.
38. H. T. Kung, “Let’s design algorithms for VLSI,” in Proc. Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol., Pasadena, 1979, pp. 65–90.
39. H. T. Kung and C. E. Leiserson, “Algorithms for VLSI processor arrays,” in C. A. Mead and L. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, sect. 8.3, pp. 271–292.
40. H. T. Kung, “The structure of parallel algorithms,” in Advances in Computers, vol. 19. New York: Academic, 1980.
41. H. T. Kung, “Why systolic architectures?,” IEEE Computer, vol. 15, Jan. 1982.
42. S. -Y. Kung et al., “Wavefront array processor: Language, architecture, and applications,” IEEE Trans. Comput., vol. C-31, pp. 1054–1066, Nov. 1982.
43. C. R. Lang, Jr., “The extension of object-oriented languages to a homogeneous concurrent architecture,” Dep. Comput. Sci., California Inst. Technol., Pasadena, Tech. Rep. 5014:TR:82, 1982.
44. D. H. Lawrie, “Access and alignment of data in an array processor,” IEEE Trans. Comput., vol. C-24, pp. 1145–1155, Dec. 1975.
45. C. Lee, “An algorithm for path connections and its applications,” IRE Trans. Electron. Comput., vol. EC-10, pp. 346–365, Sept. 1961.
46. K. Y. Liu, “Architecture for VLSI design of Reed-Solomon encoders,” in Proc. 2nd Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol., Pasadena, 1981, pp. 539–554.
47. B. Locanthi, “The homogeneous machine,” Dep. Comput. Sci., California Inst. Technol., Pasadena, Tech. Rep. 3759:TR:80, 1980.
48. C. Lutz et al., “Design of the mosaic element,” in Proc. Conf. Advanced Res. VLSI, Massachusetts Inst. Technol., Cambridge, 1984. Dedham, MA: Artech, 1984, pp. 1–10.
49. R. F. Lyon, “Two’s complement pipeline multipliers,” IEEE Trans. Commun., vol. COM-24, pp. 418–425, Apr. 1976.
50. F. Lyon, “The optical mouse, and an architectural methodology for smart digital sensors,” in Proc. CMU Conf. VLSI Syst. Comput., Oct. 1981. Rockville, MD: Comput. Sci. Press, 1981.
51. R. F. Lyon, “A bit-serial architectural methodology for signal processing,” in VLSI 81. New York: Academic, 1981.
52. A. J. Martin, “The torus: An exercise in constructing a processing surface,” in Proc. 2nd Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol., Pasadena, 1981, pp. 527–538.
53. S. Mattisson, “A concurrent circuit simulator,” Dep. Comput. Sci., California Inst. Technol., Pasadena, Tech. Rep. 5142:TR:84, 1984.
54. C. A. Mead and L. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
55. C. A. Mead and M. Rem, “Minimum propagation delays in VLSI,” IEEE J. Solid-State Circuits, vol. SC-17, pp. 773–775, Aug. 1982.
56. E. Moore, “Shortest path through a maze,” Ann. Comput. Lab. Harvard Univ., vol. 30, pp. 285–292, 1959.
57. G. E. Moore, “Are we really ready for VLSI?,” in Proc. Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol., Pasadena, 1979.
58. T. Moto-oka and H. S. Stone, “Fifth generation computer systems: A Japanese project,” IEEE Computer, vol. 17, pp. 6–13, Mar. 1984.
59. J. H. Patel, “Analysis of multiprocessors with private cache memories,” IEEE Trans. Comput., vol. C-31, pp. 296–304, Apr. 1982.
60. D. A. Patterson and C. H. Sequin, “Design considerations for single-chip computers of the future,” IEEE J. Solid-State Circuits, vol. SC-15, Feb. 1980.
61. M. C. Pease, III, “An adaptation of the fast Fourier transform for parallel processing,” J. Ass. Comput. Mach., vol. 15, pp. 252–264, 1968.
62. M. C. Pease, III, “The indirect binary n-cube microprocessor array,” IEEE Trans. Comput., vol. C-26, pp. 458–473, May 1977.
63. F. P. Preparata, “A mesh-connected area-time optimal VLSI integer multiplier,” in Proc. CMU Conf. VLSI Syst. Comput., 1981. Rockville, MD: Comput. Sci. Press, 1981.
64. J. T. Schwartz, “Ultracomputers,” ACM Trans. Programming Languages Syst., vol. 2, pp. 484–521, Oct. 1980.
65. C. L. Seitz, “System timing,” in C. A. Mead and L. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
66. C. L. Seitz, “Ensemble architectures for VLSI — A survey and taxonomy,” in Proc. Conf. Advanced Res. VLSI, Massachusetts Inst. Technol., Cambridge, Jan. 1982. Dedham, MA: Artech, 1982, pp. 130–135.
67. C. L. Seitz, “Experiments with VLSI ensemble machines,” J. VLSI Comput. Syst., vol. 1, no. 3, 1984.
68. C. L. Seitz and J. Matisoo, “Engineering limits on computer performance,” Phys. Today, pp. 38–45, May 1984.
69. C. L. Seitz, “The cosmic cube,” Commun. Ass. Comput. Mach., to be published, Dec. 1984.
70. H. J. Siegel, “Interconnection networks for SIMD machines,” IEEE Computer, vol. 12, pp. 57–65, June 1979.
71. C. S. Slemaker, R. C. Mosteller, L. W. Leyking, and A. G. Livitsanos, “A programmable printed wiring router,” in Proc. 11th Design Automat. Workshop, June 1974.
72. L. Snyder, “Introduction to the configurable highly parallel computer,” IEEE Computer, vol. 15, pp. 47–56, Jan. 1982.
73. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, 1971.
74. H. S. Stone, Ed., Introduction to Computer Architecture. Chicago, IL: Sci. Res. Assoc., 1975, particularly pp. 318–374.
75. W. -K. Su, “Super mesh,” M.S. thesis, Dep. Comput. Sci., California Inst. Technol., Pasadena, Tech. Rep. 5125:TR:84, 1984.
76. H. Sullivan and T. R. Brashkow, “A large scale homogeneous machine I & II,” in Proc. 4th Annu. Symp. Comput. Architecture, 1977, pp. 105–124.
77. I. E. Sutherland and C. A. Mead, “Microelectronics and computer science,” Sci. Amer., vol. 237, pp. 210–229, Sept. 1977.
78. R.J. Swan et al., “CM* — A modular multimicroprocessor,” in Proc. Nat. Comput. Conf., vol. 46. AFIPS Press, 1977, pp. 637–644.
79. R. M. Swanson and J. D. Meindl, “Ion-implanted complementary MOS transistors in low-voltage circuits,” IEEE J. Solid-State Circuits, vol. SC-7, pp. 146–153, Apr. 1972.
80. J. J. Symanski. “NOSC systolic processor testbed,” Naval Ocean Syst. Cen., Tech. Rep. TR NOSC TD 588, June 1983.
81. J. E. Tanner, M. H. Raibert, and R. Eskenazi, “A VLSI tactile sensing array computer,” in Proc. 2nd Caltech Conf. VLSI, Dep. Comput. Sci., California Inst. Technol. Pasadena, Jan. 1981, pp. 217–234.
82. J. E. Tanner and C. Mead, “A correlating optical motion detector,” in Proc. Conf. Advanced Res. VLSI, Massachusetts Inst. Technol., Cambridge, Jan. 1984. Dedham, MA: Artech, 1984, 57–64.
83. C. D. Thompson, “A complexity theory for VLSI,” Dep. Comput. Sci., Camegie-Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-80-140, Aug. 1980.
84. C. D. Thompson, “The VLSI complexity of sorting,” in Proc. CMC Conf. VLSI Syst. Comput., Computer Science Press, Oct. 1981, pp. 108–118.
85. C. D. Thompson,, “The VLSI complexity of sorting,” IEEE Trans. Comput., vol. C-32, pp. 1171–1184, Dec. 1983.
86. U. Weiser and A. Davis, “A wavefront notation tool for VLSI array design,” in Proc. CMC Conf. VLSI Syst. Comput., Computer Science Press, Oct. 1981, pp. 226–234.
87. D. Whiting, “Bit serial Reed-Solomon decoders,” Ph.D. dissertation, Dep. Comput. Sci., California Inst. Technol., June 1984.
88. D. W. L. Yen and A. V. Kulkami, “The ESL systolic processor for signal & image processing,” in Proc. 1981 IEEE Comput. Soc. Workshop Comput. Arch. Pattern Anal. Image Database Management, Nov. 1981, pp. 265–272.