PPoPP 2014

46 papers

1. 21st century computer architecture · Mark D. Hill
2. A decomposition for in-place matrix transposition · Bryan Catanzaro, Alexander Keller, Michael Garland
3. A general technique for non-blocking trees · Trevor Brown, Faith Ellen, Eric Ruppert
4. A practical wait-free simulation for lock-free data structures · Shahar Timnat, Erez Petrank
5. A tool to analyze the performance of multithreaded programs on NUMA architectures · Xu Liu, John M. Mellor-Crummey
6. Automatic semantic locking · Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv, Eran Yahav
7. Beyond parallel programming with domain specific languages · Kunle Olukotun
8. CUDA-NP: realizing nested thread-level parallelism in GPGPU applications · Yi Yang, Huiyang Zhou
9. Concurrency bug localization using shared memory access pairs · Wenwen Wang, Chenggang Wu, Pen-Chung Yew, Xiang Yuan, Zhenjiang Wang, Jianjun Li + 1 more
10. Concurrency testing using schedule bounding: an empirical study · Paul Thomson, Alastair F. Donaldson, Adam Betts
11. Data structures for task-based priority scheduling · Martin Wimmer, Francesco Versaci, Jesper Larsson Träff, Daniel Cederman, Philippas Tsigas
12. Designing and auto-tuning parallel 3-D FFT for computation-communication overlap · Sukhyun Song, Jeffrey K. Hollingsworth
13. Detecting silent data corruption through data dynamic monitoring for scientific applications · Leonardo Arturo Bautista-Gomez, Franck Cappello
14. Efficient deterministic multithreading without global barriers · Kai Lu, Xu Zhou, Tom Bergan, Xiaoping Wang
15. Efficient search for inputs causing high floating-point errors · Wei-Fan Chiang, Ganesh Gopalakrishnan, Zvonimir Rakamaric, Alexey Solovyev
16. Eliminating global interpreter locks in ruby through hardware transactional memory · Rei Odaira, José G. Castaños, Hisanobu Tomari
17. Extracting logical structure and identifying stragglers in parallel execution traces · Katherine E. Isaacs, Todd Gamblin, Abhinav Bhatele, Peer-Timo Bremer, Martin Schulz, Bernd Hamann
18. Fast concurrent lock-free binary search trees · Aravind Natarajan, Neeraj Mittal
19. Fine-grain parallel megabase sequence comparison with multiple heterogeneous GPUs · Edans F. de O. Sandes, Guillermo Miranda, Alba Cristina Magalhaes Alves de Melo, Xavier Martorell, Eduard Ayguadé
20. Heterogeneous computing: what does it mean for compiler research? · Norm Rubin
21. In-place transposition of rectangular matrices on accelerators · I-Jui Sung, Juan Gómez-Luna, José María González-Linares, Nicolás Guil, Wen-mei W. Hwu
22. Infrastructure-free logging and replay of concurrent execution on multiple cores · Kyu Hyung Lee, Dohyeong Kim, Xiangyu Zhang
23. Initial study of multi-endpoint runtime for MPI+OpenMP hybrid programming model on multi-core systems · Miao Luo, Xiaoyi Lu, Khaled Hamidouche, Krishna Chaitanya Kandalla, Dhabaleswar K. Panda
24. Leveraging hardware message passing for efficient thread synchronization · Darko Petrovic, Thomas Ropars, André Schiper
25. Lock contention aware thread migrations · Kishore Kumar Pusukuri, Rajiv Gupta, Laxmi Narayan Bhuyan
26. Optimistic transactional boosting · Ahmed Hassan, Roberto Palmieri, Binoy Ravindran
27. PREDATOR: predictive false sharing detection · Tongping Liu, Chen Tian, Ziang Hu, Emery D. Berger
28. Parallelization hints via code skeletonization · Cfir Aguston, Yosi Ben-Asher, Gadi Haber
29. Parallelizing dynamic programming through rank convergence · Saeed Maleki, Madanlal Musuvathi, Todd Mytkowicz
30. Portable, MPI-interoperable coarray fortran · Chaoran Yang, Wesley Bland, John M. Mellor-Crummey, Pavan Balaji
31. Practical concurrent binary search trees via logical ordering · Dana Drachsler, Martin T. Vechev, Eran Yahav
32. Provably good scheduling for parallel programs that use data structures through implicit batching · Kunal Agrawal, Jeremy T. Fineman, Brendan Sheridan, Jim Sukha, Robert Utterback
33. Race directed scheduling of concurrent programs · Mahdi Eslamimehr, Jens Palsberg
34. Resilient X10: efficient failure-aware programming · David Cunningham, David Grove, Benjamin Herta, Arun Iyengar, Kiyokuni Kawachiya, Hiroki Murata + 3 more
35. Revisiting loop fusion in the polyhedral framework · Sanyam Mehta, Pei-Hung Lin, Pen-Chung Yew
36. SCCMulti: an improved parallel strongly connected components algorithm · Daniel Tomkins, Timmie G. Smith, Nancy M. Amato, Lawrence Rauchwerger
37. Singe: leveraging warp specialization for high performance on GPUs · Michael Bauer, Sean Treichler, Alex Aiken
38. Task mapping stencil computations for non-contiguous allocations · Vitus J. Leung, David P. Bunde, Jonathan Ebbers, Stefan P. Feer, Nickolas W. Price, Zachary D. Rhodes + 1 more
39. Theoretical analysis of classic algorithms on highly-threaded many-core GPUs · Lin Ma, Kunal Agrawal, Roger D. Chamberlain
40. Time-warp: lightweight abort minimization in transactional memory · Nuno Lourenco Diegues, Paolo Romano
41. Towards fair and efficient SMP virtual machine scheduling · Jia Rao, Xiaobo Zhou
42. Trace driven dynamic deadlock detection and reproduction · Malavika Samak, Murali Krishna Ramanathan
43. Triolet: a programming system that unifies algorithmic skeleton interfaces for high-performance cluster computing · Christopher I. Rodrigues, Thomas B. Jablin, Abdul Dakkak, Wen-mei W. Hwu
44. Well-structured futures and cache locality · Maurice Herlihy, Zhiyu Liu
45. X10 and APGAS at Petascale · Olivier Tardieu, Benjamin Herta, David Cunningham, David Grove, Prabhanjan Kambadur, Vijay A. Saraswat + 3 more
46. yaSpMV: yet another SpMV framework on GPUs · Shengen Yan, Chao Li, Yunquan Zhang, Huiyang Zhou