Table of Contents

• 21st century computer architectureMark D. Hill. 1-2 [doi]
• PREDATOR: predictive false sharing detectionTongping Liu, Chen Tian, Ziang Hu, Emery D. Berger. 3-14 [doi]
• Concurrency testing using schedule bounding: an empirical studyPaul Thomson, Alastair F. Donaldson, Adam Betts. 15-28 [doi]
• Trace driven dynamic deadlock detection and reproductionMalavika Samak, Murali Krishna Ramanathan. 29-42 [doi]
• Efficient search for inputs causing high floating-point errorsWei-Fan Chiang, Ganesh Gopalakrishnan, Zvonimir Rakamaric, Alexey Solovyev. 43-52 [doi]
• X10 and APGAS at PetascaleOlivier Tardieu, Benjamin Herta, David Cunningham, David Grove, Prabhanjan Kambadur, Vijay A. Saraswat, Avraham Shinnar, Mikio Takeuchi, Mandana Vaziri. 53-66 [doi]
• Resilient X10: efficient failure-aware programmingDavid Cunningham, David Grove, Benjamin Herta, Arun Iyengar, Kiyokuni Kawachiya, Hiroki Murata, Vijay A. Saraswat, Mikio Takeuchi, Olivier Tardieu. 67-80 [doi]
• Portable, MPI-interoperable coarray fortranChaoran Yang, Wesley Bland, John M. Mellor-Crummey, Pavan Balaji. 81-92 [doi]
• CUDA-NP: realizing nested thread-level parallelism in GPGPU applicationsYi Yang, Huiyang Zhou. 93-106 [doi]
• yaSpMV: yet another SpMV framework on GPUsShengen Yan, Chao Li, Yunquan Zhang, Huiyang Zhou. 107-118 [doi]
• Singe: leveraging warp specialization for high performance on GPUsMichael Bauer, Sean Treichler, Alex Aiken. 119-130 [doi]
• Eliminating global interpreter locks in ruby through hardware transactional memoryRei Odaira, José G. Castaños, Hisanobu Tomari. 131-142 [doi]
• Leveraging hardware message passing for efficient thread synchronizationDarko Petrovic, Thomas Ropars, André Schiper. 143-154 [doi]
• Well-structured futures and cache localityMaurice Herlihy, Zhiyu Liu. 155-166 [doi]
• Time-warp: lightweight abort minimization in transactional memoryNuno Lourenco Diegues, Paolo Romano. 167-178 [doi]
• Beyond parallel programming with domain specific languagesKunle Olukotun. 179-180 [doi]
• Designing and auto-tuning parallel 3-D FFT for computation-communication overlapSukhyun Song, Jeffrey K. Hollingsworth. 181-192 [doi]
• A decomposition for in-place matrix transpositionBryan C. Catanzaro, Alexander Keller, Michael Garland. 193-206 [doi]
• In-place transposition of rectangular matrices on acceleratorsI-Jui Sung, Juan Gómez-Luna, José María González-Linares, Nicolas Guil, Wen-mei W. Hwu. 207-218 [doi]
• Parallelizing dynamic programming through rank convergenceSaeed Maleki, Madanlal Musuvathi, Todd Mytkowicz. 219-232 [doi]
• Revisiting loop fusion in the polyhedral frameworkSanyam Mehta, Pei-Hung Lin, Pen-Chung Yew. 233-246 [doi]
• Triolet: a programming system that unifies algorithmic skeleton interfaces for high-performance cluster computingChristopher I. Rodrigues, Thomas B. Jablin, Abdul Dakkak, Wen-mei W. Hwu. 247-258 [doi]
• A tool to analyze the performance of multithreaded programs on NUMA architecturesXu Liu, John M. Mellor-Crummey. 259-272 [doi]
• Towards fair and efficient SMP virtual machine schedulingJia Rao, Xiaobo Zhou. 273-286 [doi]
• Efficient deterministic multithreading without global barriersKai Lu, Xu Zhou, Tom Bergan, Xiaoping Wang. 287-300 [doi]
• Race directed scheduling of concurrent programsMahdi Eslamimehr, Jens Palsberg. 301-314 [doi]
• Heterogeneous computing: what does it mean for compiler research?Norm Rubin. 315-316 [doi]
• Fast concurrent lock-free binary search treesAravind Natarajan, Neeraj Mittal. 317-328 [doi]
• A general technique for non-blocking treesTrevor Brown, Faith Ellen, Eric Ruppert. 329-342 [doi]
• Practical concurrent binary search trees via logical orderingDana Drachsler, Martin T. Vechev, Eran Yahav. 343-356 [doi]
• A practical wait-free simulation for lock-free data structuresShahar Timnat, Erez Petrank. 357-368 [doi]
• Lock contention aware thread migrationsKishore Kumar Pusukuri, Rajiv Gupta, Laxmi Narayan Bhuyan. 369-370 [doi]
• Infrastructure-free logging and replay of concurrent execution on multiple coresKyu Hyung Lee, Dohyeong Kim, Xiangyu Zhang. 371-372 [doi]
• Parallelization hints via code skeletonizationCfir Aguston, Yosi Ben-Asher, Gadi Haber. 373-374 [doi]
• Concurrency bug localization using shared memory access pairsWenwen Wang, Chenggang Wu, Pen-Chung Yew, Xiang Yuan, Zhenjiang Wang, Jianjun Li, Xiaobing Feng 0002. 375-376 [doi]
• Task mapping stencil computations for non-contiguous allocationsVitus J. Leung, David P. Bunde, Jonathan Ebbers, Stefan P. Feer, Nickolas W. Price, Zachary D. Rhodes, Matthew Swank. 377-378 [doi]
• Data structures for task-based priority schedulingMartin Wimmer 0003, Francesco Versaci, Jesper Larsson Träff, Daniel Cederman, Philippas Tsigas. 379-380 [doi]
• Detecting silent data corruption through data dynamic monitoring for scientific applicationsLeonardo Arturo Bautista Gomez, Franck Cappello. 381-382 [doi]
• Fine-grain parallel megabase sequence comparison with multiple heterogeneous GPUsEdans F. de O. Sandes, Guillermo Miranda, Alba Cristina Magalhaes Alves de Melo, Xavier Martorell, Eduard Ayguadé. 383-384 [doi]
• Automatic semantic lockingGuy Golan-Gueta, G. Ramalingam, Mooly Sagiv, Eran Yahav. 385-386 [doi]
• Optimistic transactional boostingAhmed Hassan, Roberto Palmieri, Binoy Ravindran. 387-388 [doi]
• Provably good scheduling for parallel programs that use data structures through implicit batchingKunal Agrawal, Jeremy T. Fineman, Brendan Sheridan, Jim Sukha, Robert Utterback. 389-390 [doi]
• Theoretical analysis of classic algorithms on highly-threaded many-core GPUsLin Ma, Kunal Agrawal, Roger D. Chamberlain. 391-392 [doi]
• SCCMulti: an improved parallel strongly connected components algorithmDaniel Tomkins, Timmie G. Smith, Nancy M. Amato, Lawrence Rauchwerger. 393-394 [doi]
• Initial study of multi-endpoint runtime for MPI+OpenMP hybrid programming model on multi-core systemsMiao Luo, Xiaoyi Lu, Khaled Hamidouche, Krishna Chaitanya Kandalla, Dhabaleswar K. Panda. 395-396 [doi]
• Extracting logical structure and identifying stragglers in parallel execution tracesKatherine E. Isaacs, Todd Gamblin, Abhinav Bhatele, Peer-Timo Bremer, Martin Schulz, Bernd Hamann. 397-398 [doi]