Basic-Block Based Instruction Prefetching for Real-Time Applications


(*) Corresponding author


Authors' affiliations


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


In the paper, a basic block based instruction prefetching (BBIP) mechanism is proposed that takes advantage of the relative small program size of the real-time application and the all or none attribute of basic blocks during execution. BBIP can not only avoid the useless prefetchings that exist in existing prefetching mechanisms, but also simplify the worst-case execution time (WCET) analysis of real-time applications. Results of simulation on 17 typical real-time benchmarks show that, about 70% to 80% misses can be removed, which leads to a remarkable decrease in execution time, about 50% for most benchmarks, even as high as 58%, compared with that collected on caches without instruction prefetching.
Copyright © 2013 Praise Worthy Prize - All rights reserved.

Keywords


Basic Block; Instruction Prefetching; Real-Time; WCET

Full Text:

PDF


References


R.D. Arnold, F. Mudler, D. Whalley, M. Harmon, Bounding Worst-Case Instruction Cache Performance. Proc．15th Real-Time Systems Symposium (RTSS), Brookline, Massachusetts, Dec. 1994.

C. Ferdinand, F. Martin, R. Wilhelm, M. Alt, Cache behaviour prediction by abstract interpretation. Science of Computer Programming, Elsevier, 1998.

F. Mueller, Timing analysis for instruction caches. Real-Time Systems, 18(2-3): 217-247, May 2000

R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckman, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat and P. Stenstrom, The Worst-case execution time problem - overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems, January 2007.

A.J. Smith. Sequential program prefetching in memory hierarchies. IEEE Computer, Vol 11, pp. 7-21. 1978

G. Reinman, B. Calder and T. Andaustin, Fetch directed instruction prefetching, Proc. of the 32nd International Symposium on Microarchitecture, 1999.

V. Srinivasan, E. Davidson, G. Tyson, M. Charney, T. Puzak, Branch history guided instruction prefetching, Proc. of the 7th International Conference on High Performance Computer Architecture (HPCA), 2001.

P. Chow, P. Hammarlund, T. Aamodt, P. Marcullo, H. Wang, Hardware support for prescient instruction prefetch, Proc. of International Symposium on High Performance Computer architecture, 2004.

M. Lee, S. Min, C. Kim, A worst case timing analysis technique for instruction prefetch buffers, Microprocessing and Microprogramming. 1994.

J. Yan, W. Zhang, Wcet analysis of instruction caches with prefetching, Proc. of ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, 2007.

Y.Q. Ding, J. Yan, W. Zhang, Optimizing Instruction Prefetching to Improve Worst-Case Performance for Real-Time Applications, Journal of Computing Science and Engineering, Vol. 3, No. 1, pp. 59-71, March 2009.

M. Schoeberl, time predictable instruction cache for a Java processor. Workshop on Java Technologies for Real-Time and Embedded Systems (JTRES), Vol 3292 of LNCS, pp. 371–382, Agia Napa, Cyprus, Oct 2004.

X. Li, Y. Liang, T. Mitra, A. Roychoudhury, Chronos: a timing analyzer for embedded software, Science of Computer Programming, October, 2007.

T.Austin, E. Larson, D. Ernst, SimpleScalar: An Infrastructure for Computer System Modeling. IEEE Computer, Vol 35, n. 2, pp. 59-67, 2002.

Homepage of SNU real-time benchmark suite. http://archi.snu.ac.kr/realtime/benchmark, Oct, 2007.


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize