The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
An accurate worst case timing analysis for RISC processors
Abstract
An accurate and safe estimation of a task's worst case execution time (WCET) is crucial for reasoning about the timing properties of real time systems. In RISC processors, the execution time of a program construct (e.g., a statement) is affected by various factors such as cache hits/misses and pipeline hazards, and these factors impose serious problems in analyzing the WCETs of tasks. To analyze the timing effects of RISC's pipelined execution and cache memory, we propose extensions to the original timing schema where the timing information associated with each program construct is a simple time bound. In our approach, associated with each program construct is worst case timing abstraction, (WCTA), which contains detailed timing information of every execution path that might be the worst case execution path of the program construct. This extension leads to a revised timing schema that is similar to the original timing schema except that concatenation and pruning operations on WCTAs are newly defined to replace the add and max operations on time bounds in the original timing schema. Our revised timing schema accurately accounts for the timing effects of pipelined execution and cache memory not only within but also across program constructs. The paper also reports on preliminary results of WCET analysis for a RISC processor. Our results show that tight WCET bounds (within a maximum of about 30% overestimation) can be obtained by using the revised timing schema approach.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,370
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
Calculating the maximum execution time of real-time programs
Puschner, P. P., & Koza, C. (1989) · Real-Time Systems · doi:10.1007/bf00571421 · Cited by 573
The Architecture of Pipelined Computers
Kogge, P. M. (1981) · Medical Entomology and Zoology · Cited by 536
Reasoning about time in higher-level language software
Shaw, A. C. (1989) · IEEE Transactions on Software Engineering · doi:10.1109/32.29487 · Cited by 369
Predicting program execution times by analyzing static and dynamic program paths
Park, C. Y. (1993) · Real-Time Systems · doi:10.1007/bf01088696 · Cited by 250
Self-citationAspects of Cache Memory and Instruction Buffer Performance
Hill, M. D. (1987) · doi:10.21236/ada604007 · Cited by 245
Register allocation by priority-based coloring
Chow, F., & Hennessy, J. (1984) · Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84 · doi:10.1145/502874.502896 · Cited by 220
SMART (strategic memory allocation for real-time) cache design
Kirk, D. B. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1989.63574 · Cited by 166
Pipelined processors and worst case execution times
Zhang, N., Burns, A., & Nicholson, M. (1993) · Real-Time Systems · doi:10.1007/bf01088834 · Cited by 99
A retargetable technique for predicting execution time
Harmon, M. G., Baker, T. P., & Whalley, D. B. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1992.242675 · Cited by 75
Cited by
The worst-case execution-time problem—overview of methods and survey of tools
Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., et al. (2008) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1347375.1347389 · Cited by 1,871
Power reduction techniques for microprocessor systems
Venkatachalam, V., & Franz, M. (2005) · ACM Computing Surveys · doi:10.1145/1108956.1108957 · Cited by 390
A catalog of stream processing optimizations
Hirzel, M., Soulé, R., Schneider, S., Gedik, B., & Grimm, R. (2014) · ACM Computing Surveys · doi:10.1145/2528412 · Cited by 299
Metadata
- Authors
- Lim, S.-S., Bae, Y. H., Jang, G. T., Rhee, B.-D., Min, S. L., Park, C. Y., Shin, H., Park, K., Moon, S.-M., & Kim, C. S.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1995-07
- Volume
- 21
- Issue
- 7
- Pages
- 593-604
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2118297067
- Cited by
- 254
- References
- 11
- FWCI
- 10.42
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.