A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing
- 28 March 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 255 (1-2) , 449-481
- https://doi.org/10.1016/s0304-3975(99)00313-8
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- An efficient solution to the cache thrashing problem caused by true data sharingIEEE Transactions on Computers, 1998
- Finding legal reordering transformations using mappingsPublished by Springer Nature ,1995
- False sharing and spatial locality in multiprocessor cachesIEEE Transactions on Computers, 1994
- An iteration partition approach for cache or local memory thrashing on parallel processingIEEE Transactions on Computers, 1993
- A solution of the cache ping-pong problem in multiprocessor systemsJournal of Parallel and Distributed Computing, 1992
- Partitioning and labeling of loops by unimodular transformationsIEEE Transactions on Parallel and Distributed Systems, 1992
- Compile-time partitioning of iterative parallel loops to reduce cache coherency trafficIEEE Transactions on Parallel and Distributed Systems, 1991
- Time optimal linear schedules for algorithms with uniform dependenciesIEEE Transactions on Computers, 1991
- An empirical study of Fortran programs for parallelizing compilersIEEE Transactions on Parallel and Distributed Systems, 1990
- Minimum distance: a method for partitioning recurrences for multiprocessorsIEEE Transactions on Computers, 1989