NDLI: Abstracting access patterns of dynamic memory using regular expressions

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

Abstracting access patterns of dynamic memory using regular expressions

Content Provider	ACM Digital Library
Author	Jeon, Jinseong Shin, Keoncheol Han, Hwansoo
Copyright Year	2009
Abstract	Unless the speed gap between CPU and memory disappears, efficient memory usage remains a decisive factor for performance. To optimize data usage of programs in the presence of the memory hierarchy, we are particularly interested in two compiler techniques: pool allocation and field layout restructuring. Since foreseeing runtime behaviors of programs at compile time is difficult, most of the previous work relied on profiling. On the contrary, our goal is to develop a fully automatic compiler that statically transforms input codes to use memory efficiently. Noticing that regular expressions, which denote repetition explicitly, are sufficient for memory access patterns, we describe how to extract memory access patterns as regular expressions in detail. Based on static patterns presented in regular expressions, we apply pool allocation to repeatedly accessed structures and exploit field layout restructuring according to field affinity relations of chosen structures. To make a scalable framework, we devise and apply new abstraction techniques, which build and interpret access patterns for the whole programs in a bottom-up fashion. We implement our analyses and transformations with the CIL compiler. To verify the effect and scalability of our scheme, we examine 17 benchmarks including 2 SPECINT 2000 benchmarks whose source lines of code are larger than 10,000. Our experiments demonstrate that the static layout transformations for dynamic memory can reduce L1D cache misses by 16% and execution times by 14% on average.
Starting Page	1
Ending Page	28
Page Count	28
File Format	PDF
ISSN	15443566
e-ISSN	15443973
DOI	10.1145/1498690.1498693
Volume Number	5
Issue Number	4
Journal	ACM Transactions on Architecture and Code Optimization (TACO)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-03-23
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Access patterns Field affinity Layout transformation Pool allocation Regular expressions
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Software

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

Layout Transformations for Heap Objects Using Static Access Patterns (2006)

A characterization of regular expressions under bisimulation

A hardware/software framework for instruction and data scratchpad memory allocation

Derivatives of Regular Expressions

Dynamic allocation for scratch-pad memory using compile-time decisions

Memory Access Scheduling Based on Dynamic Multilevel Priority in Shared DRAM Systems

MAPS: Optimizing Massively Parallel Applications Using Device-Level Memory Abstraction

A Dynamic Memory Allocation Algorithm

Algorithms for resolving conflicts in dynamic storage allocation

Abstracting access patterns of dynamic memory using regular expressions

Similar Documents

Layout Transformations for Heap Objects Using Static Access Patterns (2006)

A characterization of regular expressions under bisimulation

A hardware/software framework for instruction and data scratchpad memory allocation

Derivatives of Regular Expressions

Dynamic allocation for scratch-pad memory using compile-time decisions

Memory Access Scheduling Based on Dynamic Multilevel Priority in Shared DRAM Systems

MAPS: Optimizing Massively Parallel Applications Using Device-Level Memory Abstraction

A Dynamic Memory Allocation Algorithm

Algorithms for resolving conflicts in dynamic storage allocation

Abstracting access patterns of dynamic memory using regular expressions