See this document in CiteSeerX!

Multi-Staged Discrete Loops for Real-Time Systems  (Make Corrections)  
Roland Lieger, Johann Blieberger



  Home/Search   Context   Related

 
View or download:
auto.tuwien.ac.at/~bli...eumimsdl.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  auto.tuwien.ac.at/~blieb...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper Multi-Staged Discrete Loops are introduced to narrow the gap between for-loops and general loops. Although multi-staged discrete loops can be used in situations that would otherwise require general loops it is still possible to determine the maximum number of iterations, which is trivial for for-loops but extremely difficult for general loops. Thus multi-staged discrete loops form an excellent framework for determining the worst-case performance of a program. 1. Introduction One... (Update)

Similar documents (at the sentence level):
38.6%:   Multi-Staged Discrete Loops - For Real-Time Systems   (Correct)

Active bibliography (related documents):   More   All
0.1:   Loops for Safety Critical Applications - Blieberger   (Correct)
0.1:   Real-Time Recursive Procedures - Blieberger, Lieger (1995)   (Correct)
0.1:   A Project-Based Approach to Programming Language Evaluation - Howatt (1995)   (Correct)

Similar documents based on text:   More   All
1.1:   Discrete Loops and Worst Case Performance - Blieberger (1994)   (Correct)
0.5:   Worst-Case Space and Time Complexity of Recursive Procedures - Blieberger, LIEGER (1996)   (Correct)
0.3:   Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ lieger-multistaged,
  author = "Roland Lieger and Johann Blieberger",
  title = "Multi-Staged Discrete Loops for Real-Time Systems",
  url = "citeseer.ist.psu.edu/250328.html" }
Citations (may not include all citations):
1582   Scheduling algorithms for multiprogramming in a hard real-ti.. - Liu, Layland - 1973  ACM
167   Calculating the maximum execution time of real-time programs (context) - Puschner, Koza - 1989  DBLP
85   Predicting program execution times by analyzing static and d.. (context) - Park - 1993  ACM   DBLP
21   The design of real-time programming systems based on process.. (context) - Mok - 1984
9   Discrete loops and worst case performance - Blieberger - 1994  ACM   DBLP
7   The Anatomy of Programming Languages (context) - Fischer, Grodzinsky - 1993  ACM

Documents on the same site (http://www.auto.tuwien.ac.at/~blieb/papers.html):   More
Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999)   (Correct)
Worst-Case Space and Time Complexity of Recursive Procedures - Blieberger, LIEGER (1996)   (Correct)
Symbolic Pointer Analysis for Detecting Memory Leaks - Scholz, Blieberger, Fahringer (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC