Annual review of computer science vol. 1, 1986
Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Time/space trade-offs for reversible computation
SIAM Journal on Computing
Computer aided logical design with emphasis on VLSI (4th ed.)
Computer aided logical design with emphasis on VLSI (4th ed.)
Cost of silicon viewed from VLSI design perspective
DAC '94 Proceedings of the 31st annual Design Automation Conference
Theoretical Computer Science - Special volume on Petri nets
Communications of the ACM
Asynchronous Digital Circuit Design
Asynchronous Digital Circuit Design
Logic Synthesis and Verification
Logic Synthesis and Verification
The case for the reduced instruction set computer
ACM SIGARCH Computer Architecture News
Programming a paintable computer
Programming a paintable computer
Advances in dataflow programming languages
ACM Computing Surveys (CSUR)
Computation: finite and infinite machines
Computation: finite and infinite machines
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Computer
IEEE Transactions on Information Theory
Cryptography with asynchronous logic automata
Cryptography and Security
Hi-index | 0.00 |
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