Proceedings of the 11th International Symposium on Code Generation and Optimization
CGO, 2013.

@proceedings{CGO-2013,
	acmid         = "2495258",
	address       = "Shenzhen, China",
	ee            = "http://www.computer.org/csdl/proceedings/cgo/2013/5524/00/index.html",
	isbn          = "978-1-4673-5524-7",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 11th International Symposium on Code Generation and Optimization}",
	year          = 2013,
}

Contents (33 items)

8 ×#named
6 ×#parallel
4 ×#automation
4 ×#performance
4 ×#profiling
4 ×#source code
3 ×#framework
3 ×#using
2 ×#adaptation
2 ×#algorithm

CGO-2013-AnantpurG #dependence #execution #runtime

Runtime dependence computation and execution of loops on heterogeneous systems (JA, RG), p. 10.

CGO-2013-ChoMHBM #profiling

Instant profiling: Instrumentation sampling for profiling datacenter applications (HKC, TM, REH, DB, SAM), p. 10.

CGO-2013-DioufCR #heuristic #polynomial

A polynomial spilling heuristic: Layered allocation (BD, AC, FR), p. 10.

CGO-2013-DuchateauPB #algebra #algorithm #automation #equation #linear #named

Hydra: Automatic algorithm exploration from linear algebra equations (AD, DAP, DB), p. 10.

CGO-2013-EklovNBH #memory management

Bandwidth Bandit: Quantitative characterization of memory contention (DE, NN, DBS, EH), p. 10.

CGO-2013-EmaniWO #adaptation #parallel

Smart, adaptive mapping of parallelism in the presence of external workload (MKE, ZW, MFPO), p. 10.

CGO-2013-GartleyPSG #case study #design #experience #framework #interpreter #profiling #robust #scalability

Experiences in designing a robust and scalable interpreter profiling framework (IG, MP, VS, NG), p. 10.

CGO-2013-GreweWO #parallel #source code

Portable mapping of data parallel programs to OpenCL for heterogeneous systems (DG, ZW, MFPO), p. 10.

CGO-2013-LaiS #analysis #bound #optimisation #performance

Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs (JL, AS), p. 10.

CGO-2013-LiHCZ0L #debugging #effectiveness #fault #locality #set

Effective fault localization based on minimum debugging frontier set (FL, WH, CC, LZ, XF, ZL), p. 10.

CGO-2013-RenALMPS #data type #parallel

SIMD parallelization of applications that traverse irregular data structures (BR, GA, JRL, TM, TP, WS), p. 10.

CGO-2013-RuanLWS #framework #on the #platform

On the platform specificity of STM instrumentation mechanisms (WR, YL, CW, MFS), p. 10.

CGO-2013-WangWC #android #bytecode #named

Acceldroid: Co-designed acceleration of Android bytecode (CW, YW, MC), p. 10.

CGO-2013-YanTZYS #algorithm #fine-grained #graph #named #parallel #traversal

Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms (JY, GT, XZ, EY, NS), p. 10.

CGO-2013-ArthurMRAB #debugging #named #profiling #scalability #security

Schnauzer: scalable profiling for likely security bug sites (WA, BM, RR, TMA, VB), p. 11.

CGO-2013-BaoD

Defensive loop tiling for shared cache (BB, CD), p. 11.

CGO-2013-BardizbanyanGWSLMS #data access #performance #using

Improving data access efficiency by using a tagless access buffer (TAB) (AB, PG, DBW, MS, PLE, SAM, PS), p. 11.

CGO-2013-CostaASP

Just-in-time value specialization (IRdAC, PROA, HNS, FMQP), p. 11.

CGO-2013-HomescuNLBF #automation

Profile-guided automated software diversity (AH, SN, PL, SB, MF), p. 11.

CGO-2013-HuangJBJA #automation #parallel #runtime #using

Automatically exploiting cross-invocation parallelism using runtime information (JH, TBJ, SRB, NPJ, DIA), p. 11.

CGO-2013-LeeKGKA #architecture #convergence

Convergence and scalarization for data-parallel architectures (YL, RK, VG, SWK, KA), p. 11.

CGO-2013-PienaarH #javascript #memory management #named #static analysis

JSWhiz: Static analysis for JavaScript memory leaks (JAP, RH), p. 11.

CGO-2013-RodriguesCP #integer #performance #source code

A fast and low-overhead technique to secure programs against integer overflows (RER, VHSC, FMQP), p. 11.

CGO-2013-SuiLX #adaptation #compilation #optimisation

Query-directed adaptive heap cloning for optimizing compilers (YS, YL, JX), p. 11.

CGO-2013-TanFG #detection #fault #lightweight #source code

Lightweight fault detection in parallelized programs (LT, MF, RG), p. 11.

CGO-2013-ZhangM #named #parallel

Hidp: A hierarchical data parallel language (YZ, FM), p. 11.

CGO-2013-ChoKWLLM #concurrent #source code

Practical lock/unlock pairing for concurrent programs (HKC, TK, YW, SL, HL, SAM), p. 12.

CGO-2013-ChouhanRB #interactive #profiling

Pertinent path profiling: Tracking interactions among relevant statements (RC, SR, SB), p. 12.

CGO-2013-DingZKSY #multi #scheduling

Locality-aware mapping and scheduling for multicores (WD, YZ, MTK, JS, PY), p. 12.

CGO-2013-JeonGT #named #performance #program analysis

Skadu: Efficient vector shadow memories for poly-scopic program analysis (DJ, SG, MBT), p. 12.

CGO-2013-KruijfS #analysis #code generation #evaluation #implementation

Idempotent code generation: Implementation, analysis, and evaluation (MdK, KS), p. 12.

CGO-2013-KulkarniCWS #automation #heuristic #machine learning #using

Automatic construction of inlining heuristics using machine learning (SK, JC, CW, DS), p. 12.

CGO-2013-ZhouWDS #flexibility #framework #migration #named

Profmig: A framework for flexible migration of program profiles across software versions (MZ, BW, YD, XS), p. 12.