N. Zhang A. Burns M. Nicholson Department of Computer Science, University of...  Home/Search
Context Related
Links: ACM DBLP | cs.york.ac.uk/ftpdir/...YCS93198.ps.Z cs.york.ac.uk/reports...YCS93198.ps.Z cs.york.ac.uk/ftpdir/r...YCS93198.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.york.ac.uk/ftpdir/reports/ (more) From: cs.york.ac.uk/ftpdir/reports/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The calculation of worst case execution time (WCET) is a fundamental requirement of almost all scheduling approaches for hard real-time systems. Due to their unpredicatability, hardware enhancements such as cache and pipelining are often ignored in attempts to find WCET of programs. This results in estimations that are excessively pessimistic. In this paper a simple instruction pipeline is modeled so that more accurate estimations are obtained. The model presented can be used with any... (Update)
Cited by: More
Allowing Cycle-Stealing Direct Memory Access I/O Concurrent.. - Huang, al. (1996) (Correct)
Worst Case Timing Analysis Of Concurrently Executing Dma I/o And.. - Huang (1997) (Correct)
Approximate Slack Stealing Algorithms for Fixed Priority.. - Davis (1993) (Correct)
Active bibliography (related documents): More All
0.1: Worst-Case Timing Analysis of Cycle-Stealing DMA I/O Tasks - Huang, Liu (Correct)
0.1: Worst-Case Timing Analysis of Concurrently Executing DMA I/O and.. - Huang (1997) (Correct)
0.1: Guaranteeing Hard Real Time End-to-End Communications.. - Tindell Burns Wellings (1991) (Correct)
Similar documents based on text: More All
0.3: Worst-Case Execution Time Analysis at Low Cost - Puschner (1998) (Correct)
0.2: The Worst Case Execution Time (WCET) Analysis Assignment - Ermedahl, Hansson (1997) (Correct)
0.2: Worst-Case Execution-Time Analysis for Embedded.. - Engblom, Ermedahl.. (2000) (Correct)
Related documents from co-citation: More All
30: A retargetable technique for predicting execution time - Harmon, Baker et al. - 1992
27: Calculating the maximum execution times of realtime programs (context) - Puschner, Koza - 1989
22: Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment - Liu, Layland - 1973
BibTeX entry: (Update)
N. Zhang, A. Burns, and M. Nicholson, "Pipelined Processors and Worst Case Execution Times," Real Time Systems, Vol. ?, No. 5, 1993, pp. 319-343. http://citeseer.ist.psu.edu/zhang93pipelined.html More
@techreport{ zhang93pipelined,
author = "N Zhang and A Burns and M Nicholson",
title = "Pipelined Processors and Worst Case Execution Times",
number = "YCS 198.",
year = "1993",
url = "citeseer.ist.psu.edu/zhang93pipelined.html" }
Citations (may not include all citations):8 Analysis of the Execution Time of Real-Time Tasks (context) - Woodbury - 1991 DBLP
7 The Feasibility of Response Time Predictions - An Experiment.. - Vrchoticky, Puschner - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.york.ac.uk/ftpdir/reports/): More
TAM Technical Notes 1 and 2 - Scholefield (1993) (Correct)
Debugging Distributed Ada Programs - Briggs, Jamieson, Randall, Wand (1994) (Correct)
Structuring Architectural Topologies for Real-Time.. - Nicholson, Burns (1997) (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