Array regrouping and structure splitting using whole-program reference affinity

Zhong, Yutao; Orlovich, Maksim; Shen, Xipeng; Ding, Chen

doi:10.1145/996841.996872

Cited by 98 publications

(52 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For example, reuse distance is used to analyze program locality and its access characteristics [15], to enhance the locality of programs [16], and to improve CPU cache performance [17]. The LIRS buffer cache replacement algorithm, based on a reuse distance analysis, has been proposed to effectively overcome the performance disadvantages of LRU replacement [21].…”

Section: Related Work On Reuse Distance and Localitymentioning

confidence: 99%

Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol

Jiang

Zhang

Liang

et al. 2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-In a distributed environment the utilization of file buffer caches in different clients may greatly vary. Cooperative caching has been proposed to increase cache utilization by coordinating the shared usage of distributed caches. It allows clients that would more greatly benefit from larger caches to forward data objects to peer clients with relatively underutilized caches. To support such coordination, global cache utilization must be dynamically evaluated. This in turn requires an effective analysis of application data access patterns. Existing coordination protocols are demonstrably suboptimal in this respect, exhibiting inefficient memory utilization and undue interference among clients. We propose a locality-aware cooperative caching protocol, called LAC, that is based on analysis and manipulation of data-block reuse distance to effectively predict cache utilization and the probability of data reuse at each client. Using a dynamically adaptive synchronization technique, we keep local information up to date and consistently comparable across clients. The system is highly scalable in the sense that global coordination is achieved without centralized control. We have conducted thorough trace-driven simulation experiments to assess the performance differences between LAC and various existing protocols representative of the general class. Using a realistic and representative cost model, we show that the LAC protocol significantly and consistently outperforms existing cooperative caching protocols, demonstrating high and balanced utilization of caches across all clients. In our experiments LAC reduces block access time by up to 36%, with an average of 31%, over the system without peer cache coordination, and reduces block access time by up to 22%, with an average of 13%, over the best performer of the existing protocols.

show abstract

Section: Related Work On Reuse Distance and Localitymentioning

confidence: 99%

Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol

Jiang

Zhang

Liang

et al. 2010

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…For large structures they apply field reordering such that fields with temporal affinity are located in same cache block. Zhong et al [24] describe k-distance analysis to understand data affinity and identify opportunities for array grouping and structure splitting. We use static analysis to understand fragmentation of data in cache lines, and find opportunities for structure or array splitting.…”

Section: Related Workmentioning

confidence: 99%

Pinpointing and Exploiting Opportunities for Enhancing Data Reuse

Marin

Mellor-Crummey

2008

ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and Software

View full text Add to dashboard Cite

Abstract-The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than memory. Traditional performance tools typically collect or simulate cache miss counts or rates and attribute them at the function level. While such information identifies program scopes that exhibit a large cache miss rate, it is often insufficient to diagnose the causes for poor data locality and to identify what program transformations would improve memory hierarchy utilization. This paper describes an approach that uses memory reuse distance to identify an application's most significant memory access patterns causing cache misses and provide insight into ways of improving data reuse. Unlike previous approaches, our tool combines (1) analysis and instrumentation of fully optimized binaries, (2) online analysis of reuse patterns, (3) fine-grain attribution of measurements and models to statements, loops and variables, and (4) static analysis of access patterns to quantify spatial reuse. We demonstrate the effectiveness of our approach for understanding reuse patterns in two scientific codes: one for simulating neutron transport and a second for simulating turbulent transport in burning plasmas. Our tools pinpointed opportunities for enhancing data reuse. Using this feedback as a guide, we transformed the codes, reducing their misses at various levels of the memory hierarchy by integer factors and reducing their execution time by as much as 60% and 33%, respectively.

show abstract

“…Other techniques that can be applied are structure splitting as proposed by Chilimbi et al [6], and Zhong et al [35], who also describe the opposite transformation array regrouping. Field reordering as described by Chilimbi et al [6] is another method to increase locality in recursive data structures.…”

Section: Related Workmentioning

confidence: 99%

A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures

Spek

Groot

Bakker

et al. 2008

Int J Parallel Prog

View full text Add to dashboard Cite

Irregular access patterns are a major problem for today's optimizing compilers. In this paper, a novel approach will be presented that enables transformations that were designed for regular loop structures to be applied to linked list data structures. This is achieved by linearizing access to a linked list, after which further data restructuring can be performed. Two subsequent optimization paths will be considered: annihilation and sublimation, which are driven by the occurring regular and irregular access patterns in the applications. These intermediate codes are amenable to traditional compiler optimizations targeting regular loops. In the case of sublimation, a run-time step is involved which takes the access pattern into account and thus generates a data instance specific optimized code. Both approaches are applied to a sparse matrix multiplication algorithm and an iterative solver: preconditioned conjugate gradient. The resulting transformed code is evaluated using the major compilers for the x86 platform, GCC and the Intel C compiler.

show abstract

Array regrouping and structure splitting using whole-program reference affinity

Cited by 98 publications

References 36 publications

Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol

Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol

Pinpointing and Exploiting Opportunities for Enhancing Data Reuse

A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures

Contact Info

Product

Resources

About