Carol Eidt, Anne M. Holler, Uma Srinivasan, Saman P. Amarasinghe
Proceedings of the 10th International Symposium on Code Generation and Optimization
CGO, 2012.

@proceedings{CGO-2012,
	acmid         = "2259016",
	address       = "San Jose, California, USA",
	editor        = "Carol Eidt and Anne M. Holler and Uma Srinivasan and Saman P. Amarasinghe",
	isbn          = "978-1-4503-1206-6",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 10th International Symposium on Code Generation and Optimization}",
	year          = 2012,
}

Contents (26 items)

6 ×#named
4 ×#automation
4 ×#compilation
3 ×#multi
3 ×#performance
2 ×#analysis
2 ×#clustering
2 ×#data access
2 ×#gpu
2 ×#memory management

CGO-2012-TangMS #compilation

Compiling for niceness: mitigating contention for QoS in warehouse scale computers (LT, JM, MLS), pp. 1–12.

CGO-2012-MurrayF #automation #compilation #set

Compiling for automatically generated instruction set extensions (ACM, BF), pp. 13–22.

CGO-2012-KerrDY #compilation #kernel

Dynamic compilation of data-parallel kernels for vector processors (AK, GFD, SY), pp. 23–32.

CGO-2012-LiuRCK #named #optimisation #pipes and filters #towards

Panacea: towards holistic optimization of MapReduce applications (JL, NR, STC, MTK), pp. 33–43.

CGO-2012-PlazarKMF

WCET-aware static locking of instruction caches (SP, JCK, PM, HF), pp. 44–52.

CGO-2012-MannarswamyG #compilation #transaction

Reconciling transactional conflicts with compiler’s help (SSM, RG), pp. 53–62.

CGO-2012-ZhangDS #database #named

Micro-specialization: dynamic code specialization of database management systems (RZ, SD, RTS), pp. 63–73.

CGO-2012-ZouR #detection #parallel #source code

Scan detection and parallelization in “inherently sequential” nested loop programs (YZ, SVR), pp. 74–83.

CGO-2012-CampanoniJHRWB #automation #named #parallel #source code

HELIX: automatic parallelization of irregular programs for chip multiprocessing (SC, TMJ, GHH, VJR, GYW, DMB), pp. 84–93.

CGO-2012-KimJLMA #automation #clustering

Automatic speculative DOALL for clusters (HK, NPJ, JWL, SAM, DIA), pp. 94–103.

CGO-2012-HongHYWHLWC #concurrent #multi #named #thread

HQEMU: a multi-threaded and retargetable dynamic binary translator on multicores (DYH, CCH, PCY, JJW, WCH, PL, CMW, YCC), pp. 104–113.

CGO-2012-LueckPP #debugging #interface #named

PinADX: an interface for customizable debugging with dynamic instrumentation (GL, HP, CP), pp. 114–123.

CGO-2012-ChabbiM #named

DeadSpy: a tool to pinpoint program inefficiencies (MC, JMMC), pp. 124–134.

CGO-2012-HasabnisMS #bound

Light-weight bounds checking (NH, AM, RS), pp. 135–144.

CGO-2012-ZhangGHLMA #fault tolerance #runtime

Runtime asynchronous fault tolerance via speculation (YZ, SG, JH, JWL, SAM, DIA), pp. 145–154.

CGO-2012-ZhangM #3d #clustering #gpu

Auto-generation and auto-tuning of 3D stencil codes on GPU clusters (YZ, FM), pp. 155–164.

CGO-2012-JablinJPLA #architecture #cpu #gpu

Dynamically managed data for CPU-GPU architectures (TBJ, JAJ, PP, FL, DIA), pp. 165–174.

CGO-2012-SembrantBH #modelling #performance #profiling

Phase guided profiling for fast cache modeling (AS, DBS, EH), pp. 175–185.

CGO-2012-VankaT #data flow #dependence #performance #profiling #using

Efficient and accurate data dependence profiling using software signatures (RV, JT), pp. 186–195.

CGO-2012-ParkCA #graph #modelling #predict #using

Using graph-based program characterization for predictive modeling (EP, JC, MAA), pp. 196–206.

CGO-2012-ZhouGGKNP

Hierarchical overlapped tiling (XZ, JPG, MJG, RHK, YN, DAP), pp. 207–218.

CGO-2012-JangLSL #automation #memory management #multi

An automatic code overlaying technique for multicores with explicitly-managed memory hierarchies (CJ, JL, SS, JL), pp. 219–229.

CGO-2012-MajoG #data access #memory management

Matching memory access patterns and data placement for NUMA systems (ZM, TRG), pp. 230–241.

CGO-2012-AnsaloniBHC #multi #program analysis

Deferred methods: accelerating dynamic program analysis on multicores (DA, WB, AH, LYC), pp. 242–251.

CGO-2012-MatosevicA #analysis #bottom-up #data access #performance #summary

Efficient bottom-up heap analysis for symbolic path-based data access summaries (IM, TSA), pp. 252–263.

CGO-2012-ShangXX #analysis #on-demand #points-to

On-demand dynamic summary-based points-to analysis (LS, XX, JX), pp. 264–274.