Asynchronous Control Network Optimization Using Fast Minimum-Cycle-Time Analysis

This paper proposes two methods for optimizing the control networks of asynchronous pipelines. The first uses a branch-and-bound algorithm to search for the optimum mix of the handshake components of different degrees of concurrence that provides the best throughput while minimizing asynchronous control overheads. The second method is a clustering technique that iteratively fuses two handshake components that share input channel sources or output channel destinations into a single component while preserving the behavior and satisfying the performance constraint of the asynchronous pipeline. We also propose a fast algorithm for iterative minimum-cycle-time analysis. The novelty of the proposed algorithm is that it takes advantage of the fact that only small modifications are made to the control network during each optimization iteration. When applied to nontrivial designs, the proposed optimization methods provided significant reductions in transistor count and energy dissipation in the designs' asynchronous control networks while satisfying the throughput constraints.

[1]  Rajit Manohar,et al.  Energy-efficient pipelines , 2002, Proceedings Eighth International Symposium on Asynchronous Circuits and Systems.

[2]  Chong Fatt. Law.  Design methodologies for low-power asynchronous-logic digital systems , 2008 .

[3]  Bill Lin,et al.  Control resynthesis for control-dominated asynchronous designs , 1996, Proceedings Second International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[4]  Ivan E. Sutherland,et al.  Micropipelines , 1989, Commun. ACM.

[5]  Karl Papadantonakis,et al.  Pipelining saturated accumulation , 2009, IEEE Transactions on Computers.

[6]  Paul Day,et al.  Four-phase micropipeline latch control circuits , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Luciano Lavagno,et al.  Petrify: A Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers (Special Issue on Asynchronous Circuit and System Design) , 1997 .

[8]  Tam-Anh Chu,et al.  Synthesis of self-timed VLSI circuits from graph-theoretic specifications , 1987 .

[9]  Joep L. W. Kessels,et al.  VLSI programming of a low-power asynchronous Reed-Solomon decoder for the DCC player , 1995, Proceedings Second Working Conference on Asynchronous Design Methodologies.

[10]  Piyush Prakash,et al.  Slack matching quasi delay-insensitive circuits , 2006, 12th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'06).

[11]  Steven M. Nowick,et al.  MOUSETRAP: ultra-high-speed transition-signaling asynchronous pipelines , 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

[12]  G. Nemhauser,et al.  Integer Programming , 2020 .

[13]  Luciano Lavagno,et al.  Desynchronization: Synthesis of Asynchronous Circuits From Synchronous Specifications , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Chiu-Sing Choy,et al.  Asynchronous cross-pipelined multiplier , 2001 .

[15]  Alain J. Martin.  Towards an energy complexity of computation , 2001, Inf. Process. Lett..

[16]  Ganesh Gopalakrishnan,et al.  High-level asynchronous system design using the ACK framework , 2000, Proceedings Sixth International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2000) (Cat. No. PR00586).

[17]  T. Chelcea,et al.  Resynthesis and peephole transformations for the optimization of large-scale asynchronous systems , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[18]  Peter A. Beerel,et al.  Slack matching asynchronous designs , 2006, 12th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'06).

[19]  Alberto L. Sangiovanni-Vincentelli,et al.  The best of both worlds: the efficient asynchronous implementation of synchronous specifications , 2004, Proceedings. 41st Design Automation Conference, 2004..

[20]  Rajit Manohar,et al.  Asynchronous Parallel Prefix Computation , 1998, IEEE Trans. Computers.

[21]  Manuel Silva Suárez,et al.  Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows , 1991, Applications and Theory of Petri Nets.

[22]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[23]  Eby G. Friedman,et al.  Clock distribution networks in synchronous digital integrated circuits , 2001, Proc. IEEE.

[24]  Doug A. Edwards,et al.  Attacking control overhead to improve synthesised asynchronous circuit performance , 2005, 2005 International Conference on Computer Design.

[25]  Ivan E. Sutherland,et al.  GasP control for domino circuits , 2005, 11th IEEE International Symposium on Asynchronous Circuits and Systems.

[26]  John Teifel,et al.  Energy-Efficient Pipelines , 2002, ASYNC.

[27]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[28]  Jim D. Garside,et al.  Reconfigurable latch controllers for low power asynchronous circuits , 1999, Proceedings. Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[29]  Marly Roncken,et al.  A single-rail re-implementation of a DCC error detector using a generic standard-cell library , 1995, Proceedings Second Working Conference on Asynchronous Design Methodologies.

[30]  Peter A. Beerel,et al.  Pipeline optimization for asynchronous circuits: complexity analysis and an efficient optimal algorithm , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).