Computation by asynchronously updating cellular automata
As a proof of the versatility of Pegasus, we have used it in a compiler translating C programs to hardware implementations.
1 Citation Context ...iving an implementation for a given behavioural speci cation, and concentrate on the intended functionality.
In Pegasus information about the global dataflow of the program is encoded in local s ..." We present Pegasus, a compact and expressive intermediate representation for imperative languages.
This is achieved by simulating delay insensitive circuits on it, a type of asynchronous circuit that is known for its robustness to variations in the timing of signals.
The design and layout of the Reed–Muller cell using primitives has been described in detail.
The effects of stuck-at faults in both delay-insensitive primitives and gates have been analyzed.
Such a scheme requires not only an increased number of cell states, but also the simulation of a global synchronization mechanism.
Asynchronous systems tend to use synchronization only on a local scale—if they use it at all.