NDLI: Static reuse distances for locality-based optimizations in MATLAB

Please wait, while we are loading the content...

Exascale science: the next frontier in high performance computing

Overlapping communication and computation by using a hybrid MPI/SMPSs approach

The auction: optimizing banks usage in Non-Uniform Cache Architectures

Fast and accurate NCBI BLASTP: acceleration with multiphase FPGA-based prefiltering

Streamlining GPU applications on the fly: thread divergence elimination through runtime thread-data remapping

Decomposable and responsive power models for multicore processors using performance counters

An approach to resource-aware co-scheduling for CMPs

Indemics: an interactive data intensive framework for high performance epidemic simulation

Handling task dependencies under strided and aliased references

An empirically tuned 2D and 3D FFT library on CUDA GPU

Throughput computing

Quantifying performance benefits of overlap using MPI-2 in a seismic modeling application

Cache oblivious parallelograms in iterative stencil computations

ParaLearn: a massively parallel, scalable system for learning interaction networks on FPGAs

An experimental approach to performance measurement of heterogeneous parallel applications using CUDA

Enigma: architectural and operating system support for reducing the impact of address translation

A query language for understanding component interactions in production systems

Clustering performance data efficiently at massive scales

How to unleash array optimizations on code using recursive data structures

Large-scale FFT on GPU clusters

The next-generation supercomputer project and a plan for the advanced institute for computational science

Optimal bucket algorithms for large MPI collectives on torus interconnects

Making nested parallel transactions practical using lightweight hardware support

High-throughput Bayesian network learning using heterogeneous multicore computers

Compiler and runtime support for enabling generalized reduction computations on heterogeneous parallel configurations

Timing local streams: improving timeliness in data prefetching

Adaptive multi-level cache allocation in distributed storage architectures

Speeding up Nek5000 with autotuning and specialization

A compiler-automated array compression scheme for optimizing memory intensive programs

FPGA accelerating double/quad-double high precision floating-point applications for ExaScale computing

Evaluation of parallel H.264 decoding strategies for the Cell Broadband Engine

SAMS multi-layout memory: providing multiple views of data to boost SIMD performance

InterferenceRemoval: removing interference of disk access for MPI programs through data replication

Static reuse distances for locality-based optimizations in MATLAB

Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization

Static reuse distances for locality-based optimizations in MATLAB

Content Provider	ACM Digital Library
Author	Shei, Chun-Yu Chauhan, Arun
Abstract	The problem of modeling memory locality of applications to guide compiler optimizations in a systematic manner is an important unsolved problem, made even more significant with the advent of multi-core and many-core architectures. We describe an approach based on a novel source-level metric, called static reuse distance, to model the memory behavior of applications written in matlab. We use matlab as a representative language that lets end-users express their algorithms precisely, but at a relatively high level. Matlab's "high-level" characteristics allow the static analysis to focus on large objects, such as arrays, without losing accuracy due to processor-specific layout of scalar values in memory. We present an efficient algorithm to compute static reuse distances using an extended version of dependence graphs. Our approach differs from earlier similar attempts in three important aspects: it targets high-level programming systems characterized by heavy use of libraries; it works on full programs, instead of being confined to loops; and it integrates practical mechanisms to handle separately compiled procedures as well as pre-compiled library procedures that are only available in binary form. We study matlab code, taken from real programs, to demonstrate the effectiveness of our model. Finally, we present some applications of our approach to program transformations that are known to be important in matlab, but are expected to be relevant to other similar high level languages as well.
Starting Page	295
Ending Page	304
Page Count	10
File Format	PDF
ISBN	9781450300186
DOI	10.1145/1810085.1810125
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-06-02
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Memory hierarchy Locality Matlab Compilers
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 compiler technique for improving whole-program locality

A dynamic locality optimization algorithm for linear algebra codes

A compiler technique for improving whole-program locality

Reuse distance analysis for locality optimization in loop-dominated applications

Extended lattice-based memory allocation

Automatic communication optimizations through memory reuse strategies

Model-Based Memory Hierarchy Optimizations for Sparse Matrices

Reuse-distance-based miss-rate prediction on a per instruction basis (2004)

Compiler-Directed Data Locality Optimization in MATLAB

Static reuse distances for locality-based optimizations in MATLAB

Similar Documents

A compiler technique for improving whole-program locality

A dynamic locality optimization algorithm for linear algebra codes

A compiler technique for improving whole-program locality

Reuse distance analysis for locality optimization in loop-dominated applications

Extended lattice-based memory allocation

Automatic communication optimizations through memory reuse strategies

Model-Based Memory Hierarchy Optimizations for Sparse Matrices

Reuse-distance-based miss-rate prediction on a per instruction basis (2004)

Compiler-Directed Data Locality Optimization in MATLAB

Static reuse distances for locality-based optimizations in MATLAB