Data cache locking for higher program predictability

Performance Evaluation Review

Volumn 31, Issue 1, 2003, Pages 272-282

  Vera, Xavier ^a   Lisper, Björn ^a   Xue, Jingling ^b  

^a Institutionen För Datateknik   (Sweden)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Data Cache Analysis; Worst Case Execution Time

Indexed keywords

ALGORITHMS; BENCHMARKING; DATA ACQUISITION; DATA REDUCTION; REAL TIME SYSTEMS;

DATA CACHE ANALYSIS; WORST-CASE EXECUTION TIME; WORST-CASE MEMORY PERFORMANCE (WCMP);

BUFFER STORAGE;

EID: 33646165711     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/885651.781062     Document Type: Conference Paper

References (35)

1. M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behaviour prediction by abstract interpretation. In Proceedings of Static Analysis Symposium (SAS'96), Lecture Notes in Computer Science (LNCS) 1145, pages 52-66. Springer-Verlag, September 1996.
2. R. Arnold, F. Mueller, D. Whalley, and M. Harmon. Bounding worst-case instruction cache performance. In Proceedings of 15th Real-Time Systems Symposium (RTSS'94), pages 172-181, 1994.
3. M. Campoy, A. P. Ivars, and J. V. Busquets-Mataix. Static use of locking caches in multitask preemptive real-time systems. In Proceedings of IEEE/IEE Real-Time Embedded Systems Workshop (Satellite of the IEEE Real-Time Systems Symposium), 2001.
4. S. Carr and K. Kennedy. Compiler blockability of numerical algorithms. In Proceedings of Supercomputing (SC'92), pages 114-124, Nov. 1992.
5. S. Chatterjee, V. V. Jain, A. R. Lebeck, S. Mundhra, and M. Thottethodi. Nonlinear array layout for hierarchical memory systems. In Proceedings of ACM International Conference on Supercomputing (ICS'99), pages 444-453, Rhodes, Greece, Jun. 1999.
6. S. Chatterjee, E. Parker, P. J. Hanlon, and A. R. Lebeck. Exact analysis of the cache behavior of nested loops. In ACM SIGPLAN '01 Conference on Programming Language Design and Implementation (PLDI'01), pages 286-297, 2001.
7. S. Coleman and K. S. McKinley. Tile size selection using cache organization and data layout. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'95), pages 279-290, Jun. 1995.
8. J. Engblom and A. Ermedhal. Modeling complex flows for worst-case execution time analysis. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS 2000), Dec. 2000.
9. C. Ferdinand and R. Wilhelm. Efficient and precise cache behavior prediction for real-time systems. Real-Time Systems, 17:131-181, 1999.
10. B. B. Fraguela, R. Doallo, and E. L. Zapata. Automatic analytical modeling for the estimation of cache misses. In Proceedings of International Conference on Parallel Architectures and Compilation Techniques (PACT'99), 1999.
11. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformations. Journal of Parallel and Distributed Computing, 5:587-616, 1988.
12. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Transactions on Programming Languages and Systems, 21(4):703-746, 1999.
13. C. Healey, D. Whalley, and M. Harmon. Integrating the timing analysis of pipelining and instruction caching. In Proceedings of 16th Real-Time Systems Symposium (RTSS'95), pages 288-297, 1995.
14. M. Hill. DineroIII: a uniprocessor cache simulator (http://www.cs.wisc. edu/~larus/warts.html).
15. IBM Microelectronics Division. The PowerPC 440 core, 1999.
16. M. Kandemir, A. Choudhary, P. Banerjee, and J. Ramanujam. A linear algebra framework for automatic determination of optimal data layouts. IEEE Transactions on Parallel and Distributed Systems, 10(2):115-135, Feb. 1999.
17. S. Kim, S. Min, and R. Ha. Efficient worst case timing analysis of data caching. In Proceedings of IEEE Real-Time Technology and Applications Symposium (RTAS'96), 1996.
18. D. Kirk. SMART (strategic memory allocation for real-time) cache design. In Proceedings of 10th Real-Time Systems Symposium (RTSS'89), Dec. 1989.
19. M. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance of blocked algorithms. In Proceedings of IV International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'91), Apr. 1991.
20. Y. Li, S. Malik, and A. Wolfe. Efficient microarchitecture modeling and path analysis for real-time software. In Proceedings of 16th Real-Time Systems Symposium (RTSS'95), pages 298-307, 1995.
21. Y. Li, S. Malik, and A. Wolfe. Cache modeling and path analysis for real-time software. In Proceedings of 17th Real-Time Systems Symposium (RTSS'96), 1996.
22. S. Lim, Y. Bae, G. Jang, B. Rhee, S. Min, C. Park, H. Shin, K. Park, and C. Kim. An accurate worst case timing analysis technique for RISC processors. In Proceedings of 15th Real-Time Systems Symposium (RTSS'94), Pages 97-108, 1994.
23. T. Lundqvist and P. Stenström. A method to improve the estimated worst-case performance of data caching. In Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications (RTCSA'99), pages 255-262, Dec. 1999.
24. T. Lundqvist and P. Stenström. Timing anomalies in dynamically scheduled microprocessors. In Proceedings of 20th Real-Time Systems Symposium (RTSS'99), Dec. 1999.
25. Motorola Inc. PowerPC 604e RISC Microprocessor Technical Summary, 1996.
26. T. Mowry, M. Lam, and A. Gupta. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of V Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS'92), pages 62-73, Oct. 1992.
27. G. Rivera and C.-W. Tseng. Data transformations for eliminating conflict misses. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98), pages 38-49, 1998.
28. F. Sánchez, A. González, and M. Valero. Static locality analysis for cache management. In Proceedings of International Conference on Parallel Architectures and Compilation Techniques (PACT'97), November 1997.
29. Sun Microelectronics. microSPARC-IIep User's Manual, 1997.
30. O. Temam, E. Granston, and W. Jalby. To copy or not to copy: A compile-time technique for accessing when data copying should be used to eliminate cache conflicts. In Proceedings of Supercomputing (SC'93), pages 410-419, 1993.
31. X. Vera, J. Llosa, A. Gonzalez, and N. Bermudo. A fast and accurate approach to analyze cache memory behavior. In Proceedings of European Conference on Parallel Computing (Europar'00), 2000.
32. X. Vera and J. Xue. Let's study whole program cache behaviour analytically. In Proceedings of International Symposium on High-Performance Computer Architecture (HPCA 8), Cambridge, Feb. 2002.
33. R. T. White, F. Müller, C. Healy, D. Whalley, and M. Harmon. Timing analysis for data caches and set-associative caches. In Proceedings of Third IEEE Real-Time Technology and Applications Symposium (RTAS'97), pages 192-202, 1997.
34. M. Wolf and M. Lam. A data locality optimizing algorithm. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'91), pages 30-44, Jun. 1991.
35. J. Xue and X. Vera. Efficient and accurate analytical modeling of whole-program data cache behavior. To Appear in IEEE Transactions of Computers.