Book contents
- Frontmatter
- Contents
- Acknowledgments
- 1 Introduction
- 2 Channel-based asynchronous design
- 3 Modeling channel-based designs
- 4 Pipeline performance
- 5 Performance analysis and optimization
- 6 Deadlock
- 7 A taxonomy of design styles
- 8 Synthesis-based controller design
- 9 Micropipeline design
- 10 Syntax-directed translation
- 11 Quasi-delay-insensitive pipeline templates
- 12 Timed pipeline templates
- 13 Single-track pipeline templates
- 14 Asynchronous crossbar
- 15 Design example: the Fano algorithm
- Index
- References
7 - A taxonomy of design styles
Published online by Cambridge University Press: 26 February 2010
Book contents
- Frontmatter
- Contents
- Acknowledgments
- 1 Introduction
- 2 Channel-based asynchronous design
- 3 Modeling channel-based designs
- 4 Pipeline performance
- 5 Performance analysis and optimization
- 6 Deadlock
- 7 A taxonomy of design styles
- 8 Synthesis-based controller design
- 9 Micropipeline design
- 10 Syntax-directed translation
- 11 Quasi-delay-insensitive pipeline templates
- 12 Timed pipeline templates
- 13 Single-track pipeline templates
- 14 Asynchronous crossbar
- 15 Design example: the Fano algorithm
- Index
- References
Summary
In addition to the various types of handshaking protocol discussed in Chapter 2, there is a variety of other means to characterize asynchronous design styles, which provide insight into the relative advantages and challenges associated with each design style. In this chapter we discuss several of these forms of taxonomy.
Delay models
The delay model dictates the assumptions made about delays in the gates and wires during the design process. Generally speaking the less restrictive the delay assumptions, the more robust is the design to delay variations caused by a variety of factors such as manufacturing process variations, unpredictable wire lengths, and crosstalk noise. This robustness, however, often comes at a cost such as larger area, lower performance, and/or higher power.
Delay-insensitive design
Delay-insensitive (DI) design is the most robust of all asynchronous circuit delay models. It makes no assumptions on the delay of wires or gates, i.e. they can have zero to infinity delay and can be time varying. Delay-insensitive circuits are thus very robust to all forms of variations.
Although this model is very robust, Martin showed that no practical single-output gate-level delay-insensitive circuits are possible. This result has profound significance. First, to build delay-insensitive circuits the smallest building block must be larger than a single-output gate. As one example, a network of leaf cells that communicate with delay-insensitive channels (e.g. 1-of-N channels) is a delay-insensitive circuit if we consider each leaf cell to be an atomic multi-output gate.
- Type
- Chapter
- Information
- A Designer's Guide to Asynchronous VLSI , pp. 116 - 135Publisher: Cambridge University PressPrint publication year: 2010
References
, “The limitations to delay-insensitivity in asynchronous circuits,” in Proc. 6th MIT Conf. on Advanced Research in VLSI, ed., MIT Press, 1990, pp. 263–278.Google Scholar
, “Compiling communicating processes into delay-insensitive VLSI circuits,”Distributed Computing, vol. 1, no. 4, pp. 226–234, 1986.CrossRefGoogle Scholar
, , and , “Stretching quasi delay insensitivity by means of extended isochronic forks,” in Proc. 2nd Working Conf. on Asynchronous Design Methodologies, May 1995, pp. 99–106.
, , , et al., “Scalable-delay-insensitive design: a high-performance approach to dependable asynchronous systems,” in Proc. Int. Symp. on the Future of Intellectual Integrated Electronics, March 1999, pp. 531–540.
, , , et al., “TITAC-2: a 32-bit scalable-delay-insensitive microprocessor,” in Symp. Record of HOT Chips IX, August 1997, pp. 19–32.
, , and , “Relative timing based verification of timed circuits and systems,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, April 2002, pp. 115–124.
, , and , “Relative timing,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, April 1999, pp. 208–218.
, , , et al., “CAD directions for high performance asynchronous circuits,” in Proc. ACM/IEEE Design Automation Conf., 1999, pp. 116–121.
and , CMOS VLSI Design, A Circuits and Systems Perspective (3rd Edn), Addison Wesley, 2005.Google Scholar
and , eds., Principles of Asynchronous Circuit Design: A Systems Perspective. Kluwer Academic Publishers, 2001.CrossRef
and , “Single-track asynchronous pipeline templates using 1-of-N encoding,” in Proc. Conf. on Design, Automation and Test in Europe (DATE), pp. 1008–1015, March 2002.
, “Pipelined asynchronous circuits,” Master's thesis, California Institute of Technology, 1995.Google Scholar
, , , , and , “The design and verification of a high-performance low-control-overhead asynchronous differential equation solver,”IEEE Trans. VLSI Systems, vol. 6, no. 4, pp. 643–655, December 1998.CrossRefGoogle Scholar
and , “Four-phase micropipeline latch control circuits,”IEEE Trans. on VLSI Systems, vol. 4, no. 2, pp. 247–253, June 1996.CrossRefGoogle Scholar
and , “The Tangram framework: asynchronous circuits for low power,” in Proc. Asia and South Pacific Design Automation Conf., February 2001, pp. 255–260.
, , , , and , “The VLSI-programming language Tangram and its translation into handshake circuits,” in Proc. European Conf. on Design Automation (EDAC), 1991, pp. 384–389.
, Handshake Circuits: an Asynchronous Architecture for VLSI Programming, International Series on Parallel Computation, vol. 5, Cambridge University Press, 1993.Google Scholar
, “Single-rail handshake circuits,” Ph.D. thesis, Eindhoven University of Technology, 1996.Google Scholar
, “Automated compilation of concurrent programs into self-timed circuits.” Master's thesis, California Institute of Technology, 1988.Google Scholar
, , , , , and ,“Handshake protocols for de-synchronization,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, April 2004, pp. 149–158.
, , and , “A concurrent model for de-synchronization,” in Handouts of Int. Workshop on Logic Synthesis, pp. 294–301, 2003.
, , , , and , “Asynchronous design using commercial HDL synthesis tools,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, April 2000, pp. 114–125.
, , and , “Automated pipelining in ASIC synthesis methodology: gate transfer level,” in Proc. ACM/IEEE Design Automation Conf., June 2004.
and , “Static tokens: using dataflow to automate concurrent pipeline synthesis,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, April 2004, pp. 17–27.
and , “Data-driven process decomposition for the synthesis of asynchronous circuits,” in Proc. IEEE Int. Conf. on Electronics, Circuits and Systems, 2001.
and , “High-level synthesis of asynchronous systems by data-driven decomposition,” in Proc. ACM/IEEE Design Automation Conf., June 2003, pp. 508–513.
and , “High-level synthesis of asynchronous systems: scheduling and process synchronization,” in Proc. European Conf. on Design Automation (EDAC), February 1993, pp. 70–74.
and , “The Balsa asynchronous circuit synthesis system,” in Proc. Forum on Design Languages, September 2000.
and , “Synthesising an asynchronous DMA controller with Balsa,”J. Systems Architecture, vol. 46, pp. 1309–1319, 2000.CrossRefGoogle Scholar
, “Implementing Balsa handshake circuits.” Ph.D. thesis, Department of Computer Science, University of Manchester, 2000.Google Scholar
, , , and , “High-level asynchronous system design using the ACK framework,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, April 2000, pp. 93–103.
, , , and , “A burst-mode oriented back-end for the Balsa synthesis system,” in Proc. Conf. on Design, Automation and Test in Europe (DATE), March 2002, pp. 330–337.
and , “Balsa-cube: an optimising back-end for the Balsa synthesis system,” in Proc. 14th UK Asyncronisation Forum, 2003.
and , “Phased logic: supporting the synchronous design paradigm with delay-insensitive circuitry,”IEEE Trans. Computers, vol. 45, no. 9, pp. 1031–1044, September 1996.CrossRefGoogle Scholar
, , and , “Efficient self-timing with level-encoded 2-phase dual-rail LEDR,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, 1991, pp. 55–70.
and , “Design of asynchronous circuits by synchronous CAD tools,”IEEE Design and Test of Computers, vol. 19, no. 4, pp. 107–117, July/August 2002.CrossRefGoogle Scholar
, , and , “A technique for synthesizing distributed burst-mode circuits,” in Proc. ACM/IEEE Design Automation Conf., 1996.
, , , and , “High level synthesis of timed asynchronous circuits,” in Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, IEEE Computer Society Press, March 2005.Google Scholar
, “A formal model for defining and classifying delay-insensitive circuits,” Distributed Computing, vol. 1, no. 4, pp. 197–204, 1986.CrossRefGoogle Scholar
, Private communication, 2004.
, , and , “High-level synthesis for highly concurrent hardware systems,” in Proc. Int. Conf. on Applications of Concurrency to System Design, 2006, pp. 79–90.