ACM Home Page
Please provide us with feedback. Feedback
Cyclic dependencies in modular performance analysis
Full text PdfPdf (368 KB)
Source
International Conference On Embedded Software archive
Proceedings of the 8th ACM international conference on Embedded software table of contents
Atlanta, GA, USA
SESSION: Static techniques table of contents
Pages 179-188  
Year of Publication: 2008
ISBN:978-1-60558-468-3
Authors
Bengt Jonsson  Uppsala University, Uppsala, Sweden
Simon Perathoner  Swiss Federal Institute of Technology (ETH) Zurich, Zurich, Switzerland
Lothar Thiele  Swiss Federal Institute of Technology (ETH) Zurich, Zurich, Switzerland
Wang Yi  Uppsala University, Uppsala, Sweden
Sponsors
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

The Modular Performance Analysis based on Real-Time Calculus (MPA-RTC), developed by Thiele et al., is an abstraction for the analysis of component-based real-time systems. The formalism uses an abstract stream model to characterize both workload and availability of computation and communication resources. Components can then be viewed as stream transformers. The Real-Time Calculus has been used successfully on systems where dependencies between components, via either workload or resource streams, are acyclic. For systems with cyclic dependencies the foundations and performance of the formalism are less well understood.

In this paper, we develop a general operational semantics underlying the Real-Time Calculus, and use this to show that the behavior of systems with cyclic dependencies can be analyzed by fixpoint iterations. We characterize conditions under which such iterations give safe results, and also show how precise the results can be.


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
M. Fekete. Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten. Mathematische Zeitschrift, 17:228--249, 1923.
 
2
M. Jersak, K. Richter, and R. Ernst. Performance analysis for complex embedded applications. Int. J. of Embedded Systems, 1(1/2):33--49, 2005.
 
3
G. Kahn. The semantics of a simple language for parallel programming. In IFIP 74, pages 471--475. North-Holland, 1974.
 
4
 
5
H. Schiøler, J. Jessen, J. Dalsgaard, and K. Larsen. Network calculus for real time analysis of embedded systems with cyclic task dependencies. In G. Hu, editor, Proc. 20th International Conference on Computers and Their Applications, CATA 2005, March 16-18, 2005, Louisiana, pages 326--332. ISCA, 2005.
 
6
L. Thiele, S. Chakraborty, M. Gries, and S. Künzli. Design space exploration of network processor architectures. In Network Processor Design: Issues and Practices, Volume 1, pages 55--89. 2002.
7
 
8
E. Wandeler. Modular Performance Analysis and Interface-Based Design for Embedded RealTime Systems. PhD thesis, ETH Zürich, 2006.
 
9
 
10
 
11

Collaborative Colleagues:
Bengt Jonsson: colleagues
Simon Perathoner: colleagues
Lothar Thiele: colleagues
Wang Yi: colleagues