Computation by asynchronously updating cellular automata

Rated 4.91/5 based on 912 customer reviews

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.

In Pegasus information about the global dataflow of the program is encoded in local structures, enabling compact and efficient algorithms for program optimizations.

computation by asynchronously updating cellular automata-49

computation by asynchronously updating cellular automata-25

computation by asynchronously updating cellular automata-53

computation by asynchronously updating cellular automata-1

The effects of stuck-at faults in both delay-insensitive primitives and gates have been analyzed.Research on cellular automata that are truly asynchronous has been limited mostly to trivial phenomena, leaving issues such as computation unexplored.This paper presents an asynchronously updating cellular automaton that conducts computation without relying on a simulated global synchronization mechanism.The combination of delay-insensitive circuit style and cellular arrays is a useful step to implement nanocomputing systems.In the approach proposed in this paper the circuit expressions corresponding to a design are first converted into Reed–Muller forms and then implemented using delay-insensitive Reed–Muller cells.

Leave a Reply