NDLI: Skadu: Efficient vector shadow memories for poly-scopic program analysis

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

Query-directed adaptive heap cloning for optimizing compilers

Lightweight fault detection in parallelized programs

Acceldroid: Co-designed acceleration of Android bytecode

Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs

Effective fault localization based on minimum debugging frontier set

Practical lock/unlock pairing for concurrent programs

Hidp: A hierarchical data parallel language

On the platform specificity of STM instrumentation mechanisms

Automatic construction of inlining heuristics using machine learning

A polynomial spilling heuristic: Layered allocation

JSWhiz: Static analysis for JavaScript memory leaks

Locality-aware mapping and scheduling for multicores

Smart, adaptive mapping of parallelism in the presence of external workload

Experiences in designing a robust and scalable interpreter profiling framework

Instant profiling: Instrumentation sampling for profiling datacenter applications

Pertinent path profiling: Tracking interactions among relevant statements

Profmig: A framework for flexible migration of program profiles across software versions

Skadu: Efficient vector shadow memories for poly-scopic program analysis

Bandwidth Bandit: Quantitative characterization of memory contention

SIMD parallelization of applications that traverse irregular data structures

Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms

Portable mapping of data parallel programs to OpenCL for heterogeneous systems

Profile-guided automated software diversity

Schnauzer: scalable profiling for likely security bug sites

Hydra: Automatic algorithm exploration from linear algebra equations

Automatically exploiting cross-invocation parallelism using runtime information

Idempotent code generation: Implementation, analysis, and evaluation

Improving data access efficiency by using a tagless access buffer (TAB)

Just-in-time value specialization

Defensive loop tiling for shared cache

Runtime dependence computation and execution of loops on heterogeneous systems

Convergence and scalarization for data-parallel architectures

A fast and low-overhead technique to secure programs against integer overflows

[Front cover]

[Copyright notice]

Message from the general chairs

Organizing committee

External reviewers

Author index

Skadu: Efficient vector shadow memories for poly-scopic program analysis

Content Provider	ACM Digital Library
Author	Jeon, Donghwan Garcia, Saturnino Bedford Taylor, Michael
Abstract	Shadow memory is a critical component of many dynamic program analysis frameworks with applications ranging from memory debugging to computer security. Most recent work has focused on optimizing the execution time of analyses that associate a single tag with each memory address. However, an important new class of dynamic analyses (poly-scopic analyses) requires multiple tags for each memory address. These new analyses place additional burdens on memory shadowing infrastructures, especially with regards to memory overhead. Existing shadow memory infrastructures are either unequipped to handle these additional burdens or result in runtime and memory overheads that make them impractical for all but small inputs. In this paper we propose vector shadow memories (VSMs) as an infrastructure to support poly-scopic analyses. Furthermore we introduce Skadu, a VSM implementation that employs several novel techniques to greatly reduce the runtime and memory overhead associated with the two major challenges of VSMs: tag validation and garbage collection. Our results show that on two separate poly-scopic analyses, memory footprint profiling and hierarchical critical path analysis, Skadu significantly reduces the associated memory overhead: by 14.2× and 11.4× respectively. In both cases, Skadu makes poly-scopic analysis practical for ordinary desktop and laptop machines.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	9781467355247
DOI	10.1109/CGO.2013.6494985
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-02-23
Access Restriction	Subscribed
Subject Keyword	Memory profiling poly scopic analysis vector shadow memory hierarchical critical path analysis
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

Skadu: Efficient vector shadow memories for poly-scopic program analysis

Skadu: efficient vector shadow memories for poly-scopic program analysis.

Critical Path Profiling of Message Passing and Shared-Memory Programs (1998)

An Online Computation of Critical Path Profiling (1996)

An Online Computation of Critical Path Profiling (1996)

Optimal organizations for pipelined hierarchical memories

Compactly representing parallel program executions

Efficient flow profiling for detecting performance bugs

Global critical path: a tool for system-level timing analysis

Skadu: Efficient vector shadow memories for poly-scopic program analysis

Similar Documents

Skadu: Efficient vector shadow memories for poly-scopic program analysis

Skadu: efficient vector shadow memories for poly-scopic program analysis.

Critical Path Profiling of Message Passing and Shared-Memory Programs (1998)

An Online Computation of Critical Path Profiling (1996)

An Online Computation of Critical Path Profiling (1996)

Optimal organizations for pipelined hierarchical memories

Compactly representing parallel program executions

Efficient flow profiling for detecting performance bugs

Global critical path: a tool for system-level timing analysis

Skadu: Efficient vector shadow memories for poly-scopic program analysis