CGO 2013
33 papers
- A fast and low-overhead technique to secure programs against integer overflows
- A polynomial spilling heuristic: Layered allocation
- Acceldroid: Co-designed acceleration of Android bytecode
- Automatic construction of inlining heuristics using machine learning
- Automatically exploiting cross-invocation parallelism using runtime information
- Bandwidth Bandit: Quantitative characterization of memory contention
- Convergence and scalarization for data-parallel architectures
- Defensive loop tiling for shared cache
- Effective fault localization based on minimum debugging frontier set
- Experiences in designing a robust and scalable interpreter profiling framework
- Hidp: A hierarchical data parallel language
- Hydra: Automatic algorithm exploration from linear algebra equations
- Idempotent code generation: Implementation, analysis, and evaluation
- Improving data access efficiency by using a tagless access buffer (TAB)
- Instant profiling: Instrumentation sampling for profiling datacenter applications
- JSWhiz: Static analysis for JavaScript memory leaks
- Just-in-time value specialization
- Lightweight fault detection in parallelized programs
- Locality-aware mapping and scheduling for multicores
- On the platform specificity of STM instrumentation mechanisms
- Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs
- Pertinent path profiling: Tracking interactions among relevant statements
- Portable mapping of data parallel programs to OpenCL for heterogeneous systems
- Practical lock/unlock pairing for concurrent programs
- Profile-guided automated software diversity
- Profmig: A framework for flexible migration of program profiles across software versions
- Query-directed adaptive heap cloning for optimizing compilers
- Runtime dependence computation and execution of loops on heterogeneous systems
- SIMD parallelization of applications that traverse irregular data structures
- Schnauzer: scalable profiling for likely security bug sites
- Skadu: Efficient vector shadow memories for poly-scopic program analysis
- Smart, adaptive mapping of parallelism in the presence of external workload
- Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms