default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCGO 2013: Shenzhen, China
- Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization, CGO 2013, Shenzhen, China, February 23-27, 2013. IEEE Computer Society 2013, ISBN 978-1-4673-5524-7
- Yulei Sui
, Yue Li, Jingling Xue:
Query-directed adaptive heap cloning for optimizing compilers. 1:1-1:11 - Li Tan, Min Feng, Rajiv Gupta:
Lightweight fault detection in parallelized programs. 2:1-2:11 - Cheng Wang, Youfeng Wu, Marcelo Cintra:
Acceldroid: Co-designed acceleration of Android bytecode. 3:1-3:10 - Junjie Lai, André Seznec:
Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs. 4:1-4:10 - Feng Li, Wei Huo, Congming Chen, Lujie Zhong, Xiaobing Feng, Zhiyuan Li:
Effective fault localization based on minimum debugging frontier set. 5:1-5:10 - Hyoun Kyu Cho, Terence Kelly, Yin Wang, Stéphane Lafortune, Hongwei Liao, Scott A. Mahlke:
Practical lock/unlock pairing for concurrent programs. 6:1-6:12 - Yongpeng Zhang, Frank Mueller:
Hidp: A hierarchical data parallel language. 7:1-7:11 - Wenjia Ruan, Yujie Liu, Chao Wang, Michael F. Spear:
On the platform specificity of STM instrumentation mechanisms. 8:1-8:10 - Sameer Kulkarni, John Cavazos, Christian Wimmer, Doug Simon:
Automatic construction of inlining heuristics using machine learning. 9:1-9:12 - Boubacar Diouf, Albert Cohen, Fabrice Rastello:
A polynomial spilling heuristic: Layered allocation. 10:1-10:10 - Jacques A. Pienaar, Robert Hundt:
JSWhiz: Static analysis for JavaScript memory leaks. 11:1-11:11 - Wei Ding, Yuanrui Zhang, Mahmut T. Kandemir, Jithendra Srinivas, Praveen Yedlapalli:
Locality-aware mapping and scheduling for multicores. 12:1-12:12 - Murali Krishna Emani, Zheng Wang, Michael F. P. O'Boyle:
Smart, adaptive mapping of parallelism in the presence of external workload. 13:1-13:10 - Ian Gartley, Marius Pirvu, Vijay Sundaresan, Nikola Grcevski:
Experiences in designing a robust and scalable interpreter profiling framework. 14:1-14:10 - Hyoun Kyu Cho, Tipp Moseley, Richard E. Hank, Derek Bruening, Scott A. Mahlke:
Instant profiling: Instrumentation sampling for profiling datacenter applications. 15:1-15:10 - Ramshankar Chouhan, Subhajit Roy, Surender Baswana:
Pertinent path profiling: Tracking interactions among relevant statements. 16:1-16:12 - Mingzhou Zhou, Bo Wu, Yufei Ding, Xipeng Shen:
Profmig: A framework for flexible migration of program profiles across software versions. 17:1-17:12 - Donghwan Jeon, Saturnino Garcia, Michael Bedford Taylor:
Skadu: Efficient vector shadow memories for poly-scopic program analysis. 18:1-18:12 - David Eklov, Nikos Nikoleris, David Black-Schaffer, Erik Hagersten:
Bandwidth Bandit: Quantitative characterization of memory contention. 19:1-19:10 - Bin Ren, Gagan Agrawal, James R. Larus, Todd Mytkowicz, Tomi Poutanen, Wolfram Schulte:
SIMD parallelization of applications that traverse irregular data structures. 20:1-20:10 - Jie Yan, Guangming Tan, Xiuxia Zhang, Erlin Yao, Ninghui Sun:
Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms. 21:1-21:10 - Dominik Grewe, Zheng Wang, Michael F. P. O'Boyle:
Portable mapping of data parallel programs to OpenCL for heterogeneous systems. 22:1-22:10 - Andrei Homescu, Steven Neisius, Per Larsen, Stefan Brunthaler, Michael Franz:
Profile-guided automated software diversity. 23:1-23:11 - William Arthur, Biruk Mammo, Ricardo Rodríguez Jorge, Todd M. Austin, Valeria Bertacco:
Schnauzer: scalable profiling for likely security bug sites. 24:1-24:11 - Alexandre Duchateau, David A. Padua, Denis Barthou:
Hydra: Automatic algorithm exploration from linear algebra equations. 25:1-25:10 - Jialu Huang, Thomas B. Jablin, Stephen R. Beard, Nick P. Johnson, David I. August:
Automatically exploiting cross-invocation parallelism using runtime information. 26:1-26:11 - Marc de Kruijf, Karthikeyan Sankaralingam:
Idempotent code generation: Implementation, analysis, and evaluation. 27:1-27:12 - Alen Bardizbanyan, Peter Gavin, David B. Whalley, Magnus Själander, Per Larsson-Edefors, Sally A. McKee, Per Stenström:
Improving data access efficiency by using a tagless access buffer (TAB). 28:1-28:11 - Igor Rafael de Assis Costa, Péricles Rafael Oliveira Alves, Henrique Nazaré Santos, Fernando Magno Quintão Pereira:
Just-in-time value specialization. 29:1-29:11 - Bin Bao, Chen Ding:
Defensive loop tiling for shared cache. 30:1-30:11 - Jayvant Anantpur, R. Govindarajan:
Runtime dependence computation and execution of loops on heterogeneous systems. 31:1-31:10 - Yunsup Lee, Ronny Krashinsky, Vinod Grover, Stephen W. Keckler, Krste Asanovic:
Convergence and scalarization for data-parallel architectures. 32:1-32:11 - Raphael Ernani Rodrigues, Victor Hugo Sperle Campos, Fernando Magno Quintão Pereira:
A fast and low-overhead technique to secure programs against integer overflows. 33:1-33:11
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-15 01:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
