University of Cambridge > > Churchill CompSci Talks > Asynchronous Computation

Asynchronous Computation

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland.

Most modern integrated circuits perform computations efficiently using synchronous (clocked) pipelines. These give a high throughput by exploiting parallelism. The synchronous framework gives desirable design semantics in most cases, but has some inconvenient properties which make some problems difficult to solve, and occasionally this results in an overly complicated control logic. A good example is a FIFO between two different clock domains.

This talk explores the asynchronous computation framework, from the basic ideas through transistor-level implementations of basic control structures to complex control blocks, that make for extremely easy-to-read circuit diagrams resembling flowcharts. We will also discuss the main trade-offs involved in asynchronous circuit design.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity