Predicting computation time for advanced processor architectures

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2000, Pages 89-96

  Burns, A ^a   Edgar, S ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS TECHNIQUES; BRANCH PREDICTION; COMPUTATION TIME; EXTREME VALUE ESTIMATION; MODERN PROCESSORS; PROCESSOR ARCHITECTURES; SUPERSCALAR; TEMPORAL VARIABILITY;

REAL TIME SYSTEMS;

COMPUTER ARCHITECTURE;

EID: 0001866591     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMRTS.2000.853996     Document Type: Conference Paper

References (12)

1. A. A. Balkema and L. de Haan. Residual life time at great age. A nn. Probab. 2, pp. 792-804, 1974.
2. R. Chapman, A. Burns and A. Wellings. Integrated program proof and worst-case timing analysis of SPARK Ada. A CM Workshop on language, complier and tool support for real-time systems. A CM Press, 1994.
3. R. A. Fisher and L. H. C. Tippett. Limiting forms of the frequency distribution of the largest or smallest member of a sample. Pr oceedings of the Cambridge Philosophical Society. Vol. 24, pp. 180-190, 1928.
4. D. Hildebrand. An Arc hitectural Overview of QNX. http://www.qnx.com/ literature/whitepapers/archoverview.html
5. Intel Corporation. Intel Architecture Optimization Reference Manual. Order number 245127-001.
6. B. F. Kimbell. The bias in certain estimates of the parameters of the extreme-value distribution. Ann. Math. Stats., vol. 27, pp. 758.
7. C. L. Liu and J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. JACM, 20(1), pp. 46-61, 1973.
8. C. Y. Park. Predicting program execution times by analyzing static and dynamic program paths. R eal-Time Systems, vol. 5, pp. 31-62, 1993.
9. P.Puschner and A. Schedl. Computing Maximum Task Execution Times - A Graph-Based Approach. Real-Time Systems, 13(1):67-91, July 1997. (Pubitemid 127508036)
10. J. A. Stankovic. Misconceptions About Real-Time Computing. IEEE Computer, October 1998, pp. 10-19.
11. J. Sun and J. Liu. Bounding Completion Times of Jobs with Arbitrary Release Times and Variable Execution Times. Pr oc.IEEE R eal-Time Systems Symposium 1996, pp. 2-12.
12. N. Zhang, A. Burns, and M. Nicholson. Pipelined Processors and Worst-Case Execution Times. R eal-TimeSystems, 5(4):319-343, Oct. 1993.