Abstract
The early decades of computing were marked by limited re sources. However, as we enter the twenty-first century, silicon is offering enormous computing resources on a single die and molecular-scale devices appear plausible offering a path to even greater capacities. Exploiting the capacities of these modern and future devices demands different compu tational models and radical shifts in the way we organize, capture, and optimize computations. A key shift is toward spatially organized compu tation. A natural consequence is that the dominant effects which govern our computing space change from the total number of operations and temporal locality to interconnect complexity and spatial locality. Old computational models which hide, ignore, or obfuscate communication and emphasize temporal sequences inhibit the exploitation of these mod ern capacities, motivating the need for new models which make commu nication and spatial organization more apparent.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
International Technology Roadmap for Semiconductors. <http://public.itrs.net/Files/2001ITRS/>, 2001.
Eylon Caspi, Michael Chu, Randy Huang, Nicholas Weaver, Joseph Yeh, John Wawrzynek, and André DeHon. Stream Computations Organized for Reconfigurable Execution (SCORE): Introduction and Tutorial. short version appears in FPL’2000 (LNCS 1896), 2000.
Andrè DeHon. The Density Advantage of Configurable Computing. IEEE Computer, 33(4):41–49, April 2000.
André DeHon. Compact, Multilayer Layout for Butterfly Fat-Tree. In Proceedings of the Twelfth ACM Symposium on Parallel Algorithms and Architectures (SPAA’ 2000), pages 206–215. ACM, July 2000.
André DeHon. Rent’s Rule Based Switching Requirements. In Proceedings of the System-Level Interconnect Prediction Workshop (SLIP’2001), pages 197–204. ACM, March 2001.
Daniel Dobberpuhl, Richard Witek, Randy Allmon, Robert Anglin, Sharon Britton, Linda Chao, Robert Conrad, Daniel Dever, Bruce Gieseke, Gregory Hoeppner, John Kowaleski, Kathryn Kuchler, Maureen Ladd, Michael Leary, Liam Madden, Edward McLellan, Derrick Meyer, James Montanaro, Donald Priore, Vidya Rajagopalan, Sridhar Samudrala, and Sribalan Santhanam. A 200MHz 64b Dual-Issue CMOS Microprocessor. In 1992 IEEE International Solid-State Circuits Conference, Digest of Technical Papers, pages 106–107. IEEE, February 1992.
Seth Copen Goldstein and Mihai Budiu. NanoFabrics: Spatial Computing Using Molecular Electronics. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 178–189, June 2001.
L. J. Guibas, H. T. Kung, and C. D Thompson. Direct VLSI Implemenation of Combinatorial Algorithms. In Caltech Conference on VLSI, pages 509–525, January 1979.
D. J. Hatfield and J. Gerald. Program Restructuring for Virtual Memory. IBM Systems Journal, 10(3):168–192, 1971.
Dzung T. Hoang. Searching Genetic Databases on Splash 2. In Duncan A. Buell and Kenneth L. Pocek, editors, Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines, pages 185–191, Los Alamitos, California, April 1993. IEEE Computer Society, IEEE Computer Society Press.
L. James Hwang and Abbas El Gamal. Min-Cut Replication in Partitioned Networks. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 14(1):96–106, January 1995.
Guest Editor James Meindl. Special Issue on Limits of Semiconductor Technology. Proceedings of the IEEE, 89(3):223–393, March 2001.
Gilles Kahn. The Semantics of a Simple Language for Parallel Programming. In Proceedings of the IFIP CONGRESS 74, pages 471–475. North-Holland Publishing Company, 1974.
H. T. Kung. Why Systolic Architectures? IEEE Computer, 15(1):37–46, January 1982.
H. T. Kung and Charles E. Leiserson. Systolic Arrays (for VLSI). In Proceedings of 1978 Sparse Matrix Conference, pages 256–282. Society for Industrial and Applied Mathematics, 1979.
B. S. Landman and R. L. Russo. On Pin Versus Block Relationship for Partitions of Logic Circuits. IEEE Transactions on Computers, 20:1469–1479, 1971.
Charles E. Leiserson. Systolic Priority Queues. In Proceedings of the Conference on Very Large Scale Integration: Architecture, Design, and Fabrication, pages 199–214. California Institute of Technology, 1979.
Michael R. Piacentino, Gooitzen S. van der Wal, and Michael W. Hansen. Reconfigurable Elements for a Video Pipeline Processor. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’99), pages 82–91. IEEE, 1999.
Christian Plessl and Marco Platzner. Custom Computing Machines for the Set Covering Problem. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’2002). IEEE, 2002.
Roy L. Russo. On the Tradeoff Between Logic Performance and Circuit-to-Pin Ratio for LSI. IEEE Transactions on Computers, 21(2):147–153, February 1972.
Minshine Shih and Chung-Kuan Cheng. Data Flow Partitioning for Clock Period and Latency Minimization. In Proceedings of the 31st Design Automation Conference (DAC’31), June 1994.
Reetinder Sidhu and Viktor K. Prasanna. Fast Regular Expression Matching using FPGAs. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’2001). IEEE, 2001.
Kazumasa Suzuki, Masakazu Yamashina, Takashi Nakayama, Masanori Izumikawa, Masahiro Nomura, Hiroyuki Igura, Hideki Heiuchi, Junichi Goto, Toshiaki Inoue, Youichi Koseki, Hitoshi Abiko, Kazuhiro Okabe, Atsuki Ono, Youichi Yano, and Hachiro Yamada. A 500MHz 32b 0.4μm CMOS RISC Processor LSI. In 1994 IEEE International Solid-State Circuits Conference, Digest of Technical Papers, pages 214–215. IEEE, February 1994.
Dennis Sylvester and Kurt Keutzer. Rethinking Deep-Submicron Circuit Design. IEEE Computer, 32(11):25–33, November 1999.
Hiroyuki Tomiyama and Hiroto Yasuura. Code Placement Techniques for Cache Miss Rate Reduction. ACM Transactions on Design Automation of Electronic Systems, 2(4):410–429, October 1997.
William Tsu, Kip Macy, Atul Joshi, Randy Huang, Norman Walker, Tony Tung, Omid Rowhani, Varghese George, John Wawrzynek, and André DeHon. HSRA: High-Speed, Hierarchical Synchronous Reconfigurable Array. In Proceedings of the International Symposium on Field Programmable Gate Arrays, pages 125–134, February 1999.
John Villasenor, Brian Schoner, Kang-Ngee Chia, and Charles Zapata. Configurable Computer Solutions for Automatic Target Recognition. In Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines, pages 70–79. IEEE, April 1996.
Peixin Zhong, Margaret Martonosi, Pranav Ashar, and Sharad Malik. Accelerating Boolean Satisfiability with Configurable Hardware. In Proceedings of the 1998 IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’98), pages 186–195, April 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
DeHon, A. (2002). Very Large Scale Spatial Computing. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_3
Download citation
DOI: https://doi.org/10.1007/3-540-45833-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44311-7
Online ISBN: 978-3-540-45833-3
eBook Packages: Springer Book Archive