See this document in CiteSeerX!

History-based Schemes and Implicit Path Enumeration  (Make Corrections)  
Claire Burguire and Christine Rochange Institut de Recherche en Informatique...



  Home/Search   Context   Related

 
View or download:
ncsu.edu/~mueller/wcet06...10_paper.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ncsu.edu/~mueller/wcet06/acc...10 (more)
(Enter author homepages)

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

Abstract: The Implicit Path Enumeration Technique is often used to compute the WCET of control-intensive programs. This method does not consider execution paths as ordered sequences of basic blocks but instead as sets of basic blocks with their respective execution counts. This way of describing an execution path is adequate to compute its execution time, provided that safe individual WCETs for the blocks are known. Implicit path enumeration has also been used to analyze hardware schemes like... (Update)

Active bibliography (related documents):   More   All
0.5:   A Generic Architecture for Integrated Smart Transducers - Delvai, Eisenmann, Elmenreich (2003)   (Correct)
0.2:   Determining the Worst Case Instruction Cache Miss-Ratio - Sebek, Gustafsson (2002)   (Correct)
0.2:   Validating a Worst-Case Execution Time Analysis Method.. - Engblom, Ermedahl, al. (2001)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ and-historybased,
  author = "Claire Burguire And",
  title = "History-based Schemes and Implicit Path Enumeration",
  url = "citeseer.ist.psu.edu/748048.html" }
Citations (may not include all citations):
241   A Study of Branch Prediction Strategies (context) - Smith - 1982
167   Calculating the Maximum Execution Time of Real-Time Programs (context) - Puschner, Koza - 1989
71   Performance Analysis of Embedded Software using Implicit Pat.. - Li, Malik - 1995
48   Bounding Pipeline and Instruction Cache Performance (context) - Healy, Arnold et al. - 1999
46   Efficient Microarchitecture Modeling and Path Analysis for R.. - Li, Malik et al. - 1997
31   Worst-Case Execution Time Analysis for Processors with Branc.. (context) - Colin, Puaut - 2000
21   An Integrated Path and Timing Analysis Method based on Cycle.. (context) - Lundqvist, Stenstrm - 1999
9   Towards Industry-Strength WorstCase Execution Time Analysis - Engblom, Ermedahl et al. - 1999
5   An Accurate Instruction Cache Analysis Technique for Real-Ti.. - Lim, Min et al. - 1994
2   Processor Support for Temporal Predictability - The SPEAR De.. (context) - Delvai, Huber et al. - 2003
1   Worst-Case Execution Time Analysis for Dynamic Branch Predic.. (context) - Bate, Reutemann - 2004
1   Efficient Integration of Bimodal Branch Prediction and Pipel.. (context) - Bate, Reutemann - 2005
1   A Contribution to Branch Prediction Modeling in WCET Analysi.. (context) - Burguire, Rochange - 2005
1   Modlisation d'un prdicteur de branchement bimodal dans le ca.. (context) - Burguire, Rochange - 2005
1   A Case for Static Branch Prediction in Real-Time Systems (context) - Burguire, Rochange et al. - 2005
1   a Framework for Experimenting WCET Computations (context) - Cass, Sainrat - 2006
1   Modeling Control Speculation for Timing Analysis (context) - Li, Mitra et al. - 2005
http://archi.snu.ac.kr/realtime/benchmark/

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