skip to main content
research-article
Public Access

A Theoretical Foundation for Timing Synchronous Systems Using Asynchronous Structures

Published:03 February 2020Publication History
Skip Abstract Section

Abstract

Timing of synchronous systems is an everlasting stumbling block to the booming demands for lower power consumption and higher operation speeds in the electronics industry. This hardship is aggravated by the growing levels of variability in state-of-the-art silicon dimensions and in other beyond-CMOS technologies. Although some designers continue to strongly believe in the performance advantages of being fully synchronous, others have radically shifted toward extremely robust delay-insensitive domains. Targeting a different compromise of both performance and robustness, this article provides sufficient conditions for an asynchronous system to be able to generate the periodic signals necessary for the timing of a fully synchronous system and highlights a specific hierarchical clocking structure that with a single tunable delay satisfies these conditions. Using an asynchronous clock distribution network benefits from both the natural robustness of asynchronous structures and the advantageous performance of synchronous clocking.

References

  1. Filipp Akopyan, Jun Sawada, Andrew Cassidy, Rodrigo Alvarez-Icaza, John Arthur, Paul Merolla, Nabil Imam, et al. 2015. TrueNorth: Design and tool flow of a 65 mw 1 million neuron programmable neurosynaptic chip. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 34, 10 (2015), 1537--1557.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Manish Amde, Tomaz Felicijan, Aristeidis Efthymiou, Douglas Edwards, and Luciano Lavagno. 2005. Asynchronous on-chip networks. IEE Proceedings--Computers and Digital Techniques 152, 2 (2005), 273--283.Google ScholarGoogle ScholarCross RefCross Ref
  3. Peter A. Beerel, Recep O. Ozdag, and Marcos Ferretti. 2010. A Designer’s Guide to Asynchronous VLSI. Cambridge University Press.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Jordi Cortadella, Luciano Lavagno, and Emre Tuncer. 2013. Network of tightly coupled performance monitors for determining the maximum frequency of operation of a semiconductor IC. US Patent 8,446,224.Google ScholarGoogle Scholar
  5. Jordi Cortadella, Marc Lupon, Alberto Moreno, Antoni Roca, and Sachin S. Sapatnekar. 2016. Ring oscillator clocks and margins. In Proceedings of the 2016 22nd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC’16). IEEE, Los Alamitos, CA, 19--26.Google ScholarGoogle Scholar
  6. Ali Dasdan and Rajesh K. Gupta. 1998. Faster maximum and minimum mean cycle algorithms for system-performance analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17, 10 (1998), 889--899.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Ilana David, Ran Ginosar, and Michael Yoeli. 1992. Implementing sequential machines as self-timed circuits. IEEE Transations on Computers 41, 1 (1992), 12--17.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Mike Davies, Narayan Srinivasa, Tsung-Han Lin, Gautham Chinya, Yongqiang Cao, Sri Harsha Choday, Georgios Dimou, et al. 2018. Loihi: A neuromorphic manycore processor with on-chip learning. IEEE Micro 38, 1 (2018), 82--99.Google ScholarGoogle ScholarCross RefCross Ref
  9. Eby G. Friedman. 2001. Clock distribution networks in synchronous digital integrated circuits. Proceedings of the IEEE 89, 5 (2001), 665--692.Google ScholarGoogle ScholarCross RefCross Ref
  10. Kris Gaj, Eby G. Friedman, and Marc J. Feldman. 1997. Timing of multi-gigahertz rapid single flux quantum digital circuits. Journal of VLSI Signal Processing Systems for Signal, Image and Video Technology 16, 2--3 (1997), 247--276.Google ScholarGoogle ScholarCross RefCross Ref
  11. Matthew R. Guthaus, Dennis Sylvester, and Richard B. Brown. 2008. Clock tree synthesis with data-path sensitivity matching. In Proceedings of the 2008 Asia and South Pacific Design Automation Conference. IEEE, Los Alamitos, CA, 498--503.Google ScholarGoogle Scholar
  12. Matthew R. Guthaus, Gustavo Wilke, and Ricardo Reis. 2013. Revisiting automated physical synthesis of high-performance clock networks. ACM Transactions on Design Automation of Electronic Systems 18, 2 (2013), 31.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Wenmian Hua and Rajit Manohar. 2017. Exact timing analysis for asynchronous systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 37, 1 (2018), 203--216.Google ScholarGoogle ScholarCross RefCross Ref
  14. Henrik Hulgaard, Steven M. Burns, Tod Amon, and Gaetano Borriello. 1994. An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems. Technical Report TR #94-02-02. Department of Computer Science and Engineering, University of Washington. (Available via anonymous ftp:cs.washington.edu:tr/1994/02/UW-CSE-94-02-02.PS.Z.)Google ScholarGoogle Scholar
  15. Henrik Hulgaard, Steven M. Burns, Tod Amon, and Gaetano Borriello. 1995. An algorithm for exact bounds on the time separation of events in concurrent systems. IEEE Transactions on Computers 44, 11 (1995), 1306--1317.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. ITRS. 2015. International Technology Roadmap for Semiconductors 2.0: Beyond CMOS. Available at http://www.itrs2.net/itrs-news.html.Google ScholarGoogle Scholar
  17. Yoshio Kameda, Stanislav Polonsky, Masaaki Maezawa, and Takashi Nanya. 1998. Primitive-level pipelining method on delay-insensitive model for RSFQ pulse-driven logic. In Proceedings of the 1998 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems. IEEE, Los Alamitos, CA, 262--273.Google ScholarGoogle ScholarCross RefCross Ref
  18. Evangelia Kasapaki, Martin Schoeberl, Rasmus Bo Sørensen, Christoph Müller, Kees Goossens, and Jens Sparsø. 2016. Argo: A real-time network-on-chip architecture with an efficient GALS implementation. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 24, 2 (2016), 479--492.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Milos Krstic, Eckhard Grass, Frank K. Gürkaynak, and Pascal Vivet. 2007. Globally asynchronous, locally synchronous circuits: Overview and outlook. IEEE Design 8 Test of Computers 24, 5 (2007), 430--441.Google ScholarGoogle Scholar
  20. D. Leu. 1984. Properties and applications of the token distance matrix of a marked graph. In Proceedings of the IEEE 1984 International Symposium on Circuits and Systems. 1381--1385.Google ScholarGoogle Scholar
  21. K. K. Likharev and V. K. Semenov. 1991. RSFQ logic/memory family: A new Josephson-junction technology for sub-terahertz-clock-frequency digital systems. IEEE Transactions on Applied Superconductivity 1, 1 (1991), 3--28.Google ScholarGoogle ScholarCross RefCross Ref
  22. Jan Magott. 1984. Performance evaluation of concurrent systems using Petri nets. Information Processing Letters 18, 1 (1984), 7--13.Google ScholarGoogle ScholarCross RefCross Ref
  23. Peggy B. McGee and Steven M. Nowick. 2007. An efficient algorithm for time separation of events in concurrent systems. In Proceedings of the 2007 IEEE/ACM International Conference on Computer-Aided Design. IEEE, Los Alamitos, CA, 180--187.Google ScholarGoogle Scholar
  24. T. Murata. 1982. Method for realizing the synchronic distance matrix of a marked graph. In Proceedings of the IEEE International Symposium on Circuits and Systems, Vol. 2. 609--612.Google ScholarGoogle Scholar
  25. Tadao Murata. 1989. Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77, 4 (1989), 541--580.Google ScholarGoogle ScholarCross RefCross Ref
  26. Christian D. Nielsen and Michael Kishinevsky. 1994. Performance analysis based on timing simulation. In Proceedings of the 31st Design Automation Conference. IEEE, Los Alamitos, CA, 70--76.Google ScholarGoogle Scholar
  27. C. V. Ramamoorthy and Gary S. Ho. 1980. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Transactions on Software Engineering 5 (1980), 440--449.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Raymond Reiter. 1968. Scheduling parallel computations. Journal of the ACM 15, 4 (1968), 590--599.Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Phillip J. Restle and Alina Deutsch. 1998. Designing the best clock distribution network. In Proceedings of the 1998 Symposium on VLSI Circuits. Digest of Technical Papers. IEEE, Los Alamitos, CA, 2--5.Google ScholarGoogle Scholar
  30. Danil Sokolov, Julian Murphy, Alexander Bystrov, and Alexandre Yakovlev. 2005. Design and analysis of dual-rail circuits for security applications. IEEE Transactions on Computers 54, 4 (2005), 449--460.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Ramy N. Tadros and Peter A. Beerel. 2017. A robust and tree-free hybrid clocking technique for RSFQ circuits—CSR application. In Proceedings of the 16th International Superconductive Electronics Conference (ISEC’17).Google ScholarGoogle Scholar
  32. Ramy N. Tadros and Peter A. Beerel. 2018. A robust and self-adaptive clocking technique for RSFQ cicruits—The architecture. In Proceedings of the 2018 IEEE International Symposium on Circuits and Systems (ISCAS’18). IEEE, Los Alamitos, CA.Google ScholarGoogle Scholar
  33. Ramy N. Tadros and Peter A. Beerel. 2018. A robust and self-adaptive clocking technique for SFQ circuits. IEEE Transactions on Applied Superconductivity 28, 7 (2018), 1--11.Google ScholarGoogle ScholarCross RefCross Ref
  34. N. Weste and D. Harris. 2011. CMOS VLSI Design: A Circuits and Systems Perspective. Addison-Wesley.Google ScholarGoogle Scholar

Index Terms

  1. A Theoretical Foundation for Timing Synchronous Systems Using Asynchronous Structures

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Design Automation of Electronic Systems
            ACM Transactions on Design Automation of Electronic Systems  Volume 25, Issue 2
            March 2020
            256 pages
            ISSN:1084-4309
            EISSN:1557-7309
            DOI:10.1145/3375457
            • Editor:
            • Naehyuck Chang
            Issue’s Table of Contents

            Copyright © 2020 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 3 February 2020
            • Accepted: 1 November 2019
            • Revised: 1 October 2019
            • Received: 1 April 2019
            Published in todaes Volume 25, Issue 2

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed
          • Article Metrics

            • Downloads (Last 12 months)67
            • Downloads (Last 6 weeks)14

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format .

          View HTML Format