Highly accurate and efficient evaluation of randomising set index functions

Journal of Systems Architecture

Volumn 48, Issue 13-15, 2003, Pages 429-452

  Vandierendonck, Hans ^a   De Bosschere, Koen ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Conflict misses; Microprocessor data cache; Null space; Randomisation; Randomising set index function

Indexed keywords

DATA PROCESSING; FUNCTIONS; MICROPROCESSOR CHIPS; RANDOM PROCESSES;

RANDOMISATION FUNCTIONS;

CACHE MEMORY;

EID: 0037949050     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(03)00040-7     Document Type: Article

References (45)

1. M. Schlansker, R. Shaw, S. Sivaramakrishnan, Randomization and associativity in the design of placement-insensitive caches, Technical Report, HPL-93-41, HP Laboratories, June 1993.
2. N. Topham, A. González, J. González, The design and performance of a conflict-avoiding cache, in: Proceedings of the 30th Annual International Symposium on Microarchitecture, 1997, pp. 71-80.
3. A. Seznec, A case for two-way skewed associative caches, in: Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993, pp. 169-178.
4. M. Papermaster et al., POWER3: next generation 64-bit PowerPC processor design, October 1998. Available at: 〈URL http://www.rs6000.ibm.com/resource/technology/power3wp.pdf〉.
5. J.A. Rivers, E.S. Tam, G.S. Tyson, E.S. Davidson, M. Farrens, Utilizing reuse information in data cache management, in: ICS'98, Proceedings of the 1998 International Conference on Supercomputing, 1998, pp. 449-456.
6. T.L. Johnson, W.-m.W. Hwu, Run-time adaptive cache hierarchy management via reference analysis, in: Proceedings of the 24th Annual International Symposium on Computer Architecture, 1997, pp. 315-326.
7. G. Tyson, M. Farrens, J. Matthews, A.R. Pleszkun, A modified approach to data cache management, in: Proceedings of the 28th Annual International Symposium on Microarchitecture, 1995, pp. 93-103.
8. A. Agarwal, S.D. Pudar, Column-associative caches: a technique for reducing the miss rate of direct mapped caches, in: Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993, pp. 179-190.
9. B. Calder, D. Grunwald, J. Emer, Predictive sequential associative cache, in: 2nd International Symposium on High Performance Computer Architecture, 1996, pp. 244-253.
10. K.B. Theobald, H.H.J. Hum, G.R. Gao, A design framework for hybrid-access caches, in: Proceedings of the 1st International Symposium on High Performance Computer Architecture, 1995, pp. 144-153.
11. N.P. Jouppi, Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers, Technical Report, WRL Technical Note TN-14, Western Research Laboratory, March 1990.
12. V. Agarwal, M. Hrishikesh, S. Keckler, D. Burger, Clock rate versus IPC: the end of the road for conventional microarchitectures, in: Proceedings of the 27th Annual International Symposium on Computer Architecture, 2000, pp. 248-259.
13. Hill M. A case for direct-mapped caches. IEEE Computer. 1988;25-40.
14. S.J.E. Wilton, N.E. Jouppi, An enhanced access and cycle time model for on-chip caches, Technical Report, 93/5, Western Research Laboratory, July 1994.
15. M. Zhang, K. Asanović, Highly-associative caches for low-power processors, in: Kool Chips Workshop, 33rd International Symposium on Microarchitecture, 2000.
16. Chilimbi T., Hill M., Making L.J.R. pointer-based data structures cache conscious. IEEE Computer. 2000;67-74.
17. Kandemir M., Ramanujam J., Coudhary A. Improving cache locality by a combination of loop and data transformations. IEEE Transactions on Computers. 48(2):1999;159-167.
18. D. Truong, F. Bodin, A. Seznec, Improving cache behaviour of dynamically allocated data structures, in: Conference on Parallel Architecture and Compilation Techniques, 1998, pp. 322-329.
19. A. González, M. Valero, N. Topham, J. Parcerisa, Eliminating cache conflict misses through XOR-based placement functions, in: ICS'97, Proceedings of the 1997 International Conference on Supercomputing, 1997, pp. 76-83.
20. Topham N., González A. Randomized cache placement for eliminating conflicts. IEEE Transactions on Computers. 48(2):1999;185-192.
21. H. Vandierendonck, K. De Bosschere, Evaluation of the performance of polynomial set index functions, in: WDDD: Workshop on Duplicating, Deconstructing and Debunking, held in conjunction with the 29th International Symposium on Computer Architecture (ISCA-29), 2002, pp. 31-41.
22. Smith A.J. A comparative study of set associative memory mapping algorithms and their use for cache and main memory. IEEE Transactions on Software Engineering. SE-4(2):1978;121-130.
23. Smith A.J. Cache memories. ACM Computing Surveys. 14(3):1982;473-530.
24. H. Vandierendonck, K. De Bosschere, Efficient profile-based evaluation of randomising set index functions for cache memories, in: 2nd International Symposium on Performance Analysis of Systems and Software, 2001, pp. 120-127.
25. Agarwal A., Horowitz M., Hennessy J. An analytical cache model. ACM Transactions on Computer Systems. 7(2):1989;184-215.
26. Hill M.D., Smith A.J. Evaluating associativity in CPU caches. IEEE Transactions on Computers. 38(12):1989;1612-1630.
27. R.A. Sugumar, S.G. Abraham, Efficient simulation of caches under optimal replacement with applications to miss characterization, in: SIGMETRICS'93. Proceedings of the the 1993 ACM Conference on Measurement and Modeling of Computer Systems, 1993, pp. 24-35.
28. B.R. Rau, Pseudo-randomly interleaved memory, in: Proceedings of the 18th Annual International Symposium on Computer Architecture, 1991, pp. 74-83.
29. Thiébaut D., Stone H. Footprints in the cache. ACM Transactions on Computer Systems. 5(4):1987;305-329.
30. Conover W. Practical Non-Parametric Statistics. 1999;John Wiley and Sons, New York.
31. Hays W. Statistics. 1963;Holt, Rinehart and Winston, New York.
32. A. González, M. Valero, N. Topham, J. Parcerisa, On the effectiveness of XOR-mapping schemes for cache memories, Technical Report, UPC-CEPBA-1996-14, Universitat Politècnica de Catalunya, 1996.
33. D. Burger, T.M. Austin, S. Bennett, Evaluating future microprocessors: the simple scalar tool set, Technical Report, Computer Sciences Department, University of Wisconsin-Madison, July 1996.
34. M.S. Lam, E.E. Rothberg, M.E. Wolf, The cache performance and optimizations of blocked algorithms, in: Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 1991, pp. 63-74.
35. F. Bodin, A. Seznec, Skewed associativity enhances performance predictability, in: Proceedings of the 22nd Annual International Symposium on Computer Architecture, 1995, pp. 265-274.
36. J.M. Frailong, W. Jalby, J. Lenfant, XOR-schemes: a flexible data organization in parallel memories, in: Proceedings of the 1985 International Conference on Parallel Processing, 1985, pp. 276-283.
37. T.-C. Chiueh, R.H. Katz, Eliminating the address translation bottleneck for physical address cache, in: Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, 1992, pp. 137-148.
38. X. Qiu, M. Dubois, Towards virtually-addressed memory hierarchies, in: Proceedings of the 7th International Symposium on High Performance Computer Architecture, 2001, pp. 51-62.
39. Singh J., Stone H., Thiébaut D. A model of workloads and its use in miss-rate prediction for fully associative caches. IEEE Transactions on Computers. 41(7):1992;811-825.
40. Thiébaut D. On the fractal dimension of computer programs and its application to the prediction of cache miss ratio. IEEE Transactions on Computers. 28(7):1988;1012-1026.
41. Temam O., Fricker C., Jalby W. Cache interference phenomena. ACM SIGMETRICS Performance Evaluation Review. 22(1):1994;261-271.
42. Harper J., Kerbyson D., Nudd G. Analytical modeling of set-associative cache behaviour. IEEE Transactions on Computers. 48(10):1999;1009-1024.
43. C. Young, N. Gloy, M. Smith, A comparative analysis of schemes for correlated branch prediction, in: Proceedings of the 22nd Annual International Symposium on Computer Architecture, 1995, pp. 276-286.
44. B. Goeman, H. Vandierendonck, K. De Bosschere, Differential FCM: increasing value prediction accuracy by improving table usage efficiency, in: Proceedings of the 7th International Symposium on High Performance Computer Architecture, 2001, pp. 207-216.
45. H. Vandierendonck, K. De Bosschere, On null spaces and their application to model randomisation and interleaving in cache memories, Technical Report, DG02-02, Ghent University, Department of Electronics and Information Systems, July 2002.