Approximate algorithms for time separation of events

Authors:
Supratik Chakraborty;David L. Dill
Affiliations:
Computer Systems Laboratory, Stanford University, Stanford, CA;Computer Systems Laboratory, Stanford University, Stanford, CA
Venue:
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 6
Cited 6

Performance analysis and optimization of asynchronous circuits

Performance analysis and optimization of asynchronous circuits
An approach to symbolic timing verification

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Linear programming for hazard elimination in asynchronous circuits

Journal of VLSI Signal Processing Systems - Special issue: asynchronous circuit design for VLSI signal processing
Min-max linear programming and the timing analysis of digital circuits

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Algorithms for Interface Timing Verification

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
The Design and Verification of A High-Performance Low-Control-Overhead Asynchronous Differential Equation Solver

ASYNC '97 Proceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems

A timing-driven design and validation methodology for embedded real-time systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Bounding Average Time Separations of Events in Stochastic Timed Petri Nets with Choice

ASYNC '99 Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
A Validation Fault Model for Timing-Induced Functional Errors

ITC '01 Proceedings of the 2001 IEEE International Test Conference
An efficient algorithm for time separation of events in concurrent systems

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Scenario-based timing verification of multiprocessor embedded applications

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Modular performance analysis of cyclic dataflow graphs

EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe a polynomial-time approximate algorithm for computing minimum and maximum time separations between all pairs of events in systems specified by acyclic timing constraint graphs. Even for acyclic graphs, the problem is NP-complete. We propose finding an approximate solution by first approximating the non-convex feasible space with a suitable convex ``envelope'', and then solving the problem efficiently in the approximate convex space. Unlike previous works, our algorithm can handle both min and max-type timing constraints in the same system, and has a computational complexity that is polynomial in the number of events. Although the computed separations are conservative in the worst-case, experiments indicate that our results are highly accurate in practice.