Abstract
Finding bounds on time separation of events is a fundamental problem in the verification and analysis of asynchronous and concurrent systems. Unfortunately, even for systems without repeated events or choice, computing exact bounds on time separation of events is an intractable problem when both min and max type timing constraints are present. In this paper, we describe a method for approximating min and max type constraints, and develop a polynomial-time algorithm for computing approximate time separation bounds in choice-free systems without repeated events. Next, we develop a pseudo-polynomial time technique for analysing a class of asynchronous systems in which events repeat over time. Unlike earlier works, our algorithms can analyse systems with both min and max type timing constraints efficiently. Although the computed bounds are conservative in the worst-case, experimental results indicate that they are fairly accurate in practice. We present formal proofs of correctness of our algorithms, and demonstrate their efficiency and accuracy by applying them to a suite of benchmarks. A complete asynchronous chip has been modelled and analysed using the proposed technique, revealing potential timing problems (already known to designers) in the datapath design.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alur R, Henzinger T A 1992 Logics and models of real-time: A survey. InReal time: Theory in practice. Lecture Notes in Computer Science #600 (eds) J W de Bakker, K Huizing, W P de Roever, G Rosenberg (Berlin: Springer-Verlag) pp. 74–106
Amon T 1993Specification, simulation and verification of timing behavior. Ph D thesis, University of Washington, Seattle, WA
Amon T, Borriello G 1992 An approach to symbolic timing verification. InProceedings of the ACM/IEEE Design Automation Conference (Los Alamitos, CA: IEEE Comput. Soc. Press) pp. 410–413
Amon T, Hulgaard H 1999 Symbolic time separation of events. InProceedings of International Symposium on Advanced Research in Asynchronous Circuits and Systems (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 83–93
Amon T, Hulgaard H, Borriello G, Burns S 1992 Timing analysis of concurrent systems. Tech. Rep. UW-CS-TR-92-11-01, University of Washington, Seattle, WA
Amon T, Borriello G, Hu D, Liu J 1997 Symbolic timing verification of timing diagrams using Presburger formulas. InProceedings of the ACM/IEEE Design Automation Conference (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 226–231
Berks R, Ebergen J 1997 Response time properties of linear pipelines with varying cell delays. InProceedings of the ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 179–188
Borriello G1998A new interface specification methodology and its application to transducer synthesis. Ph.D thesis, University of California at Berkeley, CA
Brzozowski J A, Gahlinger T, Mavaddat F 1991 Consistency and satisfiability of waveform timing specifications.Networks 21: 91–107
Burks TM, Sakallah K A 1993 Min-max linear programming and the timing analysis of digital circuits. InProceedings of the International Conference on Computer-Aided Design (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 152–155
Burns S M 1991Performance analysis and optimization of asynchronous circuits. Ph D thesis, California Institute of Technology, Pasadena, CA
Chakraborty S 1998Polynomial-time techniques for approximate timing analysis of asynchronous systems, Ph D thesis, Stanford University, CA
Chakraborty S, Dill D L 1997 Approximate algorithms for time separations of events. InProceeding of the IEEE/ACM Internation Conference on Computer-Aided Design (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 190–194
Chakraborty S, Dill D L, Yun K Y, Chang K-Y 1997 Timing analysis for extended burst-mode circuits. InProceedings of the Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 101–111
Chakraborty S, Yun K Y, Dill D L 1998 Practical timing analysis of asynchronous circuits using time separations of events. InProceedings of the IEEE Custom Integrated Circuits Conference (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 455–458
Chakraborty S, Yun K Y, Dill D L 1999 Timing analysis of asynchronous systems using time separation of events.IEEE Trans. Comput. Aided Design 18: 1061–1076
Chou P, Borriello G 1995 Interval scheduling: Fine-grained code scheduling for embedded systems. InProceeding of the ACM/IEEE Design Automation Conference (Los Alamitos, CA: IEEE Comput. Soc. Press) pp. 462–467
Ebergen J, Berks R 1997 Response time properties of some asynchronous circuits. InProceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 76–86
Gahlinger T 1990Coherence and satisfiability of waveform timing specifications. Ph D thesis, University of Waterloo, Waterloo, Ontario
Girodias P, Cerny E, Older W J 1997 Solving linear, min and max constraint systems using CLP based on relational arithmetic.Theor. Comput. Sci. 173: 253–281
Gunawardena J 1994 Timing analysis of digital circuits and the theory of min-max functions. Tech. Rep. HPL-94-39, Hewlett-Packard Laboratory, Palo Alto, CA
Hulgaard H 1995Timing analysis and verification of timed asynchronous circuits. Ph D thesis, University of Washington, Seattle, WA
Hulgaard H, Burns S M 1994 Bounded delay timing analysis of a class of CSP programs with choice. InProceedings of the 1st International Symposium of Advanced Research in Asynchronous Circuits and Systems (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 2–11
Hulgaard H, Burns S M, Amon T, Borriello G 1994 An algorithm for exact bounds on time separation of events in concurrent systems. Tech. Report, No. UW-CSE-94-02-02, Dept. of Computer Sci. Eng., Univ. of Washington, Seattle, WA
Hulgaard H, Burns S M, Amon T, Borriello G 1995 An algorithm for exact bounds on time separation of events in concurrent systems.IEEE Trans. Comput. 44: 1306–1317
Kudva P, Gopalakrishnan G, Brunvand E 1994 Performance analysis and optimization for asynchronous circuits. InProceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors, Oct. 1994, pp 221–225
Lavagno L, Sangiovanni-Vincentelli A L 1994 Linear programming for optimum hazard elimination in asynchronous circuits.J. VLSI Signal Process. 7: 137–60
Lee T K 1995A general approach to performance analysis and optimization of asynchronous circuits. Ph D thesis, California Institute of Technology, Pasadena, CA
Mavaddat F, Gahlinger T 1998 On deducing timing constraints in the verification of interfaces.Formal Methods Syst. Design 12: 223–239
McMillan K L, Dill D L 1992 Algorithms for interface timing verification. InProceedings of the IEEE International Conference in Computer Design: VLSI in Computers and Processors (Los Alamitos, CA: IEEE Comput. Soc. Press) pp. 48–51
Mller J, Lichtenberg J, Andersen H R, Hulgaard H1999 Difference decision diagrams. Tech. Rep. ITTR-1999-023, Department of Information Technology, Technical University of Denmark, Lyngby
Myers C J 1995Computers-aided synthesis and verification of gate-level timed circuits. Ph D thesis, Stanford University, Stanford, CA
Myers C J, Meng T H-Y 1993 Synthesis of timed asychronous circuits.IEEE Trans. VLSI Syst. 1: 106–119
Nielsen C D, Kishinevsky M 1994 Performace analysis based on timing simulation. InProceedings of the ACM/IEEE Design Automation Conference (Los Alamitos, CA: IEEE Comput. Soc. Press) pp. 70–76
Sakallah K A, Mudge T N, Olukotun O A 1990 CheckTc and minTc: Timing verification and optimal clocking of digital circuits. InProceedings of the 1990 IEEE/ACM International Conference on Computer Aided Design (New York: ACM Press)
Tofts C 1995 A compositional analysis of the performance of asynchronous pipelines. InProceedings of the ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (Los Alamitos, CA: IEEE Comput. Soc. Press)
Vanbekbergen P, Goossens G, De Man H 1992 Specification and analysis of timing constraints in signal transition graphs. InProceedings of the European Design Automation Conference (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 302–306
Walkup E A 1995Optimization of linear Max-Plus systems with application to timing analysis. Ph D thesis, University of Washington, Seattle, WA
Walkup E A, Borriello G 1994 Interface timing verification with application to synthesis. InProceedings of the ACM/IEEE Design Automation Conference (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 106–112
Williams T E 1994 Performance of iterative computation in self-timed rings.J. VLSI Signal Process. 7: 17–31
Xie A, Beerel P A 1997 Symbolic techniques for performance analysis of timed systems based on average time separation of events. InProceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (Los Alamitos, CA: IEEE Comput. Soc. Press) pp 64–75
Yen T-Y, Wolf W 1995 Performance estimation of real-time distributed embedded systems. InProceedings of IEEE International Conference on Computer Design: VLSI in Computers and Processors (Los Alamitos, CA: IEEE Comput. Soc. Press) pp. 64–69
Yen T-Y, Ishii A, Casavant A, Wolf W 1998 Efficient algorithms for interface timing verification.Formal Methods Syst. Design 12: 241–265
Yun K Y 1994Synthesis of asynchronous controllers for heterogeneous systems. Ph D thesis, Stanford University, Stanford, CA
Yun K Y, Beerel P A, Vakilotojar V, Dooply A E, Arceo J 1998 The design and verification of a high-performance low-control-overhead asynchronous differential equation solver.IEEE Trans. VLSI Syst. 6: 643–655
Author information
Authors and Affiliations
Additional information
Parts of this work are based on “Timing Analysis of Asynchronous Systems using Time Separation of Events” by Chakraborty, Dill and Yun 1999 IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 18(8): 1061–1076 ©IEEE. Permission to publish this material has been obtained from IEEE
Rights and permissions
About this article
Cite this article
Chakraborty, S., Dill, D.L. & Yun, K.Y. Efficient algorithms for approximate time separation of events. Sadhana 27, 129–162 (2002). https://doi.org/10.1007/BF02717181
Issue Date:
DOI: https://doi.org/10.1007/BF02717181