Paper Info
Title
Computation regrouping: restructuring programs for temporal data cache locality
Abstract
Data access costs contribute significantly to the execution time of applications with complex data structures. As the latency of memory accesses becomes high relative to processor cycle times, application performance is increasingly limited by memory performance. In some situations it may be reasonable to trade increased computation costs for reduced memory costs. The contributions of this paper are three-fold: we provide a detailed analysis of the memory performance of a set of seven, memory-intensive benchmarks; we describe Computation Regrouping, a general, source-level approach to improving the overall performance of these applications by improving temporal locality to reduce cache and TLB miss ratios (and thus memory stall times); and we demonstrate significant performance improvements from applying Computation Regrouping to our suite of seven benchmarks. With Computation Regrouping, we observe an average speedup of 1.97, with individual speedups ranging from 1.26 to 3.03. Most of this improvement comes from eliminating memory stall time.
Year
DOI
Venue
2002
10.1145/514191.514227
I4CS
Keywords
Field
DocType
restructuring program,execution time,reduced memory cost,significant performance improvement,optimization,memory access,application performance,memory performance,overall performance,data structures,computation regrouping,data access cost,temporal data,cache locality,complex data structure,complex data,data access,cycle time,data structure
Interleaved memory,Uniform memory access,Locality of reference,Computer science,Cache,Parallel computing,Distributed memory,Cache-only memory architecture,Real-time computing,Memory management,Non-uniform memory access
Conference
ISBN
Citations 
PageRank 
1-58113-483-5
8
0.51
References 
Authors
38
4
Name
Order
Citations
PageRank
Venkata K. Pingali112912.68
Sally A. Mckee21928152.59
Wilson C. Hsieh32532261.94
John B. Carter41785162.82