NDLI: All-window profiling and composable models of cache sharing

Content Provider	ACM Digital Library
Author	Bao, Bin Bai, Tongxin Xiang, Xiaoya Chilimbi, Trishul Ding, Chen
Abstract	As multi-core processors become commonplace and cloud computing is gaining acceptance, more applications are run in a shared cache environment. Cache sharing depends on a concept called footprint, which depends on all cache accesses not just cache misses. Previous work has recognized the importance of footprint but has not provided a method for accurate measurement, mainly because the complete measurement requires counting data access in all execution windows, which takes time quadratic in the length of a trace. The paper first presents an algorithm efficient enough for off-line use to approximately measure the footprint with a guaranteed precision. The cost of the analysis can be adjusted by changing the precision. Then the paper presents a composable model. For a set of programs, the model uses the all-window footprint of each program to predict its cache interference with other programs without running these programs together. The paper evaluates the efficiency of all-window profiling using the SPEC 2000 benchmarks and compares the footprint interference model with a miss-rate based model and with exhaustive testing.
Starting Page	91
Ending Page	102
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/2038037.1941567
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	46
Issue Number	8
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Cache interference Reuse distance Data footprint Composable models
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design 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

All-window profiling and composable models of cache sharing

All-Window Profiling and Composable Models of Cache Sharing

All-window profiling and composable models of cache sharing (2011)

Compiler-directed cache polymorphism

Predicting whole-program locality through reuse distance analysis

Generalized cache tiling for dataflow programs

Cache-conscious coallocation of hot data streams

The hardness of data packing

Value reuse optimization:reuse of evaluated math library function calls through compiler generated cache

All-window profiling and composable models of cache sharing

Similar Documents

All-window profiling and composable models of cache sharing

All-Window Profiling and Composable Models of Cache Sharing

All-window profiling and composable models of cache sharing (2011)

Compiler-directed cache polymorphism

Predicting whole-program locality through reuse distance analysis

Generalized cache tiling for dataflow programs

Cache-conscious coallocation of hot data streams

The hardness of data packing

Value reuse optimization:reuse of evaluated math library function calls through compiler generated cache

All-window profiling and composable models of cache sharing