Practical applications of an efficient time separation of events algorithm

Determining the time separation of events is a fundamental problem in the analysis, synthesis, and optimization of concurrent systems. We present results of applying an efficient algorithm to solve this problem of three different application domains. These are: analysis of instruction execution times of an asynchronous multiprocessor, analysis of a high-performance mixed asynchronous/synchronous communication interface, and isochronic fork analysis in asynchronous circuit synthesis. The algorithm we use yields exact (tight) bounds on the separation time of events in an arbitrary process graph without conditional behavior. This class of graphs is quite large and includes graphs that are not strongly connected. The algorithm is based on a functional decomposition technique that permits the implicit evaluation of an infinitely unfolded process graph.

[1]  Steven Burns.  Performance Analysis and Optimization of Asynchronous Circuits , 1991 .

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Gaetano Borriello,et al.  An algorithm for exact bounds on the time separation of events in concurrent systems , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[4]  Mark Russell Greenstreet,et al.  Stari: a technique for high-bandwidth communication , 1993 .

[5]  Alain J. Martin.  Programming in VLSI: from communicating processes to delay-insensitive circuits , 1991 .

[6]  Steven M. Burns,et al.  The design of an asynchronous microprocessor , 1989, CARN.

[7]  Teresa H. Y. Meng,et al.  Synthesis of timed asynchronous circuits , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[8]  David L. Dill,et al.  Algorithms for interface timing verification , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.