Reconfigurable Asynchronous Logic Automata (RALA)
Name
Demaine-Reconfigurable Asynchronous.pdf
Size
920.33 KB
Format
Adobe PDF
Checksum (MD5)
e5c9712dc971ed9ca4de960aa8d0b49e
Author(s)
Dalrymple, David Allen
Chen, Kailiang
Knaian, Ara N.
Green, Forrest O.
Greenwald, Scott Wilkins
Schmidt-Nielsen, Peter E.
Gershenfeld, Neil A
Demaine, Erik D
Date Issued
January 2010
Journal
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL '10)
Publisher
Association for Computing Machinery (ACM)
Citation
Neil Gershenfeld, David Dalrymple, Kailiang Chen, Ara Knaian, Forrest Green, Erik D. Demaine, Scott Greenwald, and Peter Schmidt-Nielsen. 2010. Reconfigurable asynchronous logic automata: (RALA). SIGPLAN Not. 45, 1 (January 2010), 1-6.
Version
Author's final manuscript
Abstract
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly hard to maintain as computing devices decrease in size and systems increase in complexity. Manifestations of these limits appearing in computers include scaling issues in interconnect, dissipation, and coding. Reconfigurable Asynchronous Logic Automata (RALA) is an alternative formulation of computation that seeks to align logical and physical descriptions by exposing rather than hiding this underlying reality. Instead of physical units being represented in computer programs only as abstract symbols, RALA is based on a lattice of cells that asynchronously pass state tokens corresponding to physical resources. We introduce the design of RALA, review its relationships to its many progenitors, and discuss its benefits, implementation, programming, and extensions.
MIT Department
Massachusetts Institute of Technology. Center for Bits and Atoms
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Massachusetts Institute of Technology. Media Laboratory
Program in Media Arts and Sciences (Massachusetts Institute of Technology)
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1706299.1706301
