1993 · 19 citations · 5 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureHardware-software Co-designParallel ComputingConcurrency AnalysisConcurrent ModelingInterprocess CommunicationTiming AnalysisWorst-case Execution Time AnalysisAsynchronous Circuit DesignAsynchronous Digital Circuit DesignAsynchronous SystemsCircuit SynthesisConcurrent ComputationConcurrent Process ModelingConcurrent Processes
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 to three different application domains. These are: analysis of instruction execution times of an asynchronous microprocessor, 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 Introduction Event based specifications naturally model communication and concurrency and are thus a popular model for a wide range of co...
5
The design of an asynchronous microprocessor
Alain J. Martin, Steven M. Burns, T. K. Lee et al. · ACM SIGARCH Computer Architecture News · 1989 · 184 citations · Full text
Algorithms for interface timing verification
Kenneth L. McMillan, David L. Dill · 2003 · 109 citations
Stari: a technique for high-bandwidth communication
Mark R. Greenstreet · 1993 · 36 citations
Synthesis of timed asynchronous circuits
C.J. Myers, T.H. Meng · 2003 · 28 citations