Paper by Erik D. Demaine

Reference:

Neil Gershenfeld, David Dalrymple, Kailiang Chen, Ara Knaian, Forrest Green, Erik D. Demaine, Scott Greenwald, and Peter Schmidt-Nielsen, “Reconfigurable Asynchronous Logic Automata”, in Proceedings of the 37th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 2010), Madrid, Spain, January 17–23, 2010, pages 1–6.

BibTeX

@InProceedings{RALA_POPL2010,
  AUTHOR        = {Neil Gershenfeld and David Dalrymple and Kailiang Chen and Ara Knaian and Forrest Green and Erik D. Demaine and Scott Greenwald and Peter Schmidt-Nielsen},
  TITLE         = {Reconfigurable Asynchronous Logic Automata},
  BOOKTITLE     = {Proceedings of the 37th ACM SIGACT-SIGPLAN Symposium on
                   Principles of Programming Languages (POPL 2010)},
  bookurl       = {http://www.cse.psu.edu/popl/10/index.html},
  ADDRESS       = {Madrid, Spain},
  MONTH         = {January 17--23},
  YEAR          = 2010,
  PAGES         = {1--6},

  length        = {6 pages},
  unrefereed    = 1,
  doi           = {https://dx.doi.org/10.1145/1706299.1706301},
  dblp          = {https://dblp.org/rec/conf/popl/GershenfeldDCKGDGS10},
}

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.

Length:

The paper is 6 pages.

Availability:

The paper is available in PDF (691k).

See information on file formats.

[Google Scholar search]