NDLI: A graph based framework to detect optimal memory layouts for improving data locality

Content Provider	IEEE Xplore Digital Library
Author	Kandemir, M. Choudhary, A. Ramanujam, J. Banerjee, P.
Copyright Year	1999
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Northwestern Univ., Evanston, IL, USA (Kandemir, M.)
Abstract	In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advances in caches help in better utilization of the memory hierarchy, compiler-directed locality enhancement techniques are also important. In this paper we propose a locality improvement technique that uses data space (array layout) transformations in contrast to most of the previous work based on iteration space (loop) transformations. In other words, rather than changing the order of loop iterations, our technique modifies the memory layouts of multi-dimensional arrays. In comparison with previous work on data transformations it brings two novelties. First, we formulate the problem on a special graph structure called the layout graph (LG) and use integer linear programming (ILP) methods to determine optimal layouts. Second, in addition to static layout detection, our approach also enables the compiler to determine optimal dynamic layouts; that is, the layouts that can be changed across loop nest boundaries. We believe that this is the first attempt to determine optimal dynamic memory layouts. We also present preliminary experimental results on the SGI Origin 2000 distributed shared memory multiprocessor. Our results so far are encouraging and indicate that the additional compilation time taken by the solver is tolerable.
Starting Page	738
Ending Page	743
File Size	152436
Page Count	6
File Format	PDF
ISBN	0769501435
DOI	10.1109/IPPS.1999.760558
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-04-12
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Random access memory Data structures Data mining Memory management Integer linear programming Parallel machines Cache memory Optimizing compilers Program processors Law
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A linear algebra framework for automatic determination of optimal data layouts

A compiler technique for improving whole-program locality

A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality (1999)

Static and dynamic locality optimizations using integer linear programming

A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality

Improving the performance of out-of-core computations

Compiler algorithms for optimizing locality and parallelism on shared and distributed memory machines

A dynamic locality optimization algorithm for linear algebra codes

A compiler technique for improving whole-program locality

A graph based framework to detect optimal memory layouts for improving data locality

Similar Documents

A linear algebra framework for automatic determination of optimal data layouts

A compiler technique for improving whole-program locality

A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality (1999)

Static and dynamic locality optimizations using integer linear programming

A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality

Improving the performance of out-of-core computations

Compiler algorithms for optimizing locality and parallelism on shared and distributed memory machines

A dynamic locality optimization algorithm for linear algebra codes

A compiler technique for improving whole-program locality

A graph based framework to detect optimal memory layouts for improving data locality