1 / 18

Emerging Technologies of Computation

Emerging Technologies of Computation. Montek Singh COMP790-084 Nov 29, 2011. Today: Brownian Circuits. What is Brownian motion? Brownian Cellular Automata Asynchronous Cellular Automata Mapping Circuits to Brownian Cellular Automata Basic building blocks Higher-level building blocks

damara
Download Presentation

Emerging Technologies of Computation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Emerging Technologies of Computation Montek Singh COMP790-084 Nov 29, 2011

  2. Today: Brownian Circuits • What is Brownian motion? • Brownian Cellular Automata • Asynchronous Cellular Automata • Mapping Circuits to Brownian Cellular Automata • Basic building blocks • Higher-level building blocks • Benefits and Challenges

  3. Review of Cellular Automata • Neighborhood determines a cell’s next state • Timing: • synchronous • asynchronous

  4. Brownian Cellular Automata • Transition rules example:

  5. Linear “signal” propagation • Reversible: both directions possible • hence: “Brownian”

  6. Configuration 1: A “Hub” • Signal comes in from any of 3 directions • goes out on any of 3 directions • possibly same one!

  7. Configuration 2: A “Cjoin” • 2 horizontal signals  2 vertical signals

  8. What’s a Ratchet? • Allow one-way motion only • reverse rotation is blocked • Electronic equivalent = diode

  9. Configuration 3: Ratchet • Allows one-way propagation only

  10. Summary: 3 basic configurations • Symbolic representation:

  11. What do we need? • We need these 3 useful higher-level blocks:

  12. Build using basic configurations

  13. Build using basic configurations

  14. Build using basic configurations

  15. Build using basic configurations

  16. Build using basic configurations

  17. Build using basic configurations

  18. Benefits and Challenges • Possible to get around the timing/clocking problem • use asynchronous cellular automata • Brownian motion desirable • for backtracking • possibly for exploring solution space?? • How to implement? • still in its infancy • harness noise and fluctuations

More Related