ACM Home Page
Please provide us with feedback. Feedback
Efficient performance analysis of asynchronous systems based on periodicity
Full text PdfPdf (216 KB)
Source International Conference on Hardware Software Codesign archive
Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis table of contents
Jersey City, NJ, USA
SESSION: High-level techniques for specific applications table of contents
Pages: 225 - 230  
Year of Publication: 2005
ISBN:1-59593-161-9
Authors
Peggy B. McGee  Columbia University, New York, NY
Steven M. Nowick  Columbia University, New York, NY
E. G. Coffman, Jr.  Columbia University, New York, NY
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
SIGBED: ACM Special Interest Group on Embedded Systems
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 24,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1084834.1084892
What is a DOI?

ABSTRACT

This paper presents an efficient method for the performance analysis and optimization of asynchronous systems. An asynchronous system is modeled as a marked graph with probabilistic delay distributions. We show that these systems exhibit inherent periodic behaviors. Based on this property, we derive an algorithm to construct the state space of the system through composition and capture the time evolution of the states into a periodic Markov chain. The system is solved for important performance metrics such as the distribution of input arrival time at a component, which is useful for subsequent system optimization, as well as relative component utilization, system latency and throughput. We also present a tool to demonstrate the feasibility of this method. Initial experimental results are promising, showing over three orders of magnitude improvement in runtime and nearly two orders of magnitude decrease in the size of the state space over previously published results. While the focus of this paper is on asynchronous digital systems, our technique can be applied to other concurrent systems that exhibit global asynchronous behavior, such as GALS and embedded systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
 
5
 
6
E. Cinlar. Introduction to Stochastic Processes. Prentice-Hall, Inc., 1973.
 
7
F. Commoner, A. Holt, S. Even, and A. Pnueli. Marked directed graphs. Journal of Computer and System Sciences, 5:511--523, 1971.
 
8
 
9
W. Feller. An Introduction to Probability Theory and Its Application, Vol. 1. John Wiley and Sons, Inc., 1968.
 
10
M. Greenstreet and K. Steiglitz. Bubbles can make self-timed pipelines fast. Journal of VLSI Signal Processing, 2:139--148, 1990.
 
11
12
 
13
G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74: Proceedings of IFIP Congress 74, pages 471--475, Stockholm, Sweden, Aug. 1974. North-Holland.
 
14
 
15
E. A. Lee and D. G. Messerschmitt. Synchronous data flow. Proceedings of the IEEE, 75(9):1235--1245, Sept. 1987.
 
16
 
17
 
18
 
19
20
 
21
 
22
 
23
 
24
 
25


Collaborative Colleagues:
Peggy B. McGee: colleagues
Steven M. Nowick: colleagues
E. G. Coffman, Jr.: colleagues