Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2010
DOI: 10.1145/1706299.1706301
|View full text |Cite
|
Sign up to set email alerts
|

Reconfigurable asynchronous logic automata

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…tailored to different implementation topologies such as SOP ("AND-OR"/"NAND-only"), POS ("OR-AND"/"NORonly"), and "IMPLY-only" realisations or the newer methodologies such as "reconfigurable asynchronous logic automata (RALA)" [43] and the search for most suited template for each in terms of the coordinate system of choice and the template generation rules. Our proposed technique currently establishes a one-toone mapping between all of the possible variable combinations and the corresponding output states-representing the absence and presence of every variable (in its original and the negated form) for each of the variable combinations.…”
Section: Resultsmentioning
confidence: 99%
“…tailored to different implementation topologies such as SOP ("AND-OR"/"NAND-only"), POS ("OR-AND"/"NORonly"), and "IMPLY-only" realisations or the newer methodologies such as "reconfigurable asynchronous logic automata (RALA)" [43] and the search for most suited template for each in terms of the coordinate system of choice and the template generation rules. Our proposed technique currently establishes a one-toone mapping between all of the possible variable combinations and the corresponding output states-representing the absence and presence of every variable (in its original and the negated form) for each of the variable combinations.…”
Section: Resultsmentioning
confidence: 99%
“…2-D and 3-D patchworks of polygons and polyhedra allow for a final result with tuned sparseness and correspondingly faster folding times (due to decreased string length). Other relevant ongoing work includes analysis of bulk properties of these kinds of assemblies [33], development of actuators specifically geared toward this application [34], and cellular computing based models for executing programs across these kinds of modules (such as to compute reconfiguration strategy) with extremely low per-unit cost [35], [36].…”
Section: Discussionmentioning
confidence: 99%
“…The strategy of composing systems from smaller fungible components has already seen a broad scope of applications, ranging from computing and secure encryption algorithms [14] [15] to overcoming physical limitations for electromagnetic transceiver systems [16]. Recent work on fractionated spacecraft [17] [18] is exploring the application of this strategy to constellations of satellites.…”
Section: Wireless Networkmentioning
confidence: 99%