15. PPOPP 2010: Bangalore, India

• Tilak Agerwala:
  Exascale computing: the challenges and opportunities in the next decade. 1-2
  

Analysis and optimization of parallel programs

• Mario Méndez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, Muhammad Amber Hassaan, Milind Kulkarni, Martin Burtscher, Keshav Pingali:
  Structure-driven optimizations for amorphous data-parallel programs. 3-14
  
• Katherine E. Coons, Sebastian Burckhardt, Madanlal Musuvathi:
  GAMBIT: effective unit testing for concurrency libraries. 15-24
  
• Jonathan K. Lee, Jens Palsberg:
  Featherweight X10: a core calculus for async-finish parallelism. 25-36
  
• Sandya Mannarswamy, Dhruva R. Chakrabarti, Kaushik Rajan, Sujoy Saraswati:
  Compiler aided selective lock assignment for improving the performance of software transactional memory. 37-46
  

Supporting transactional memory

• Christopher J. Rossbach, Owen S. Hofmann, Emmett Witchel:
  Is transactional programming actually easier? 47-56
  
• Ferad Zyulkyarov, Tim Harris, Osman S. Unsal, Adrián Cristal, Mateo Valero:
  Debugging programs that use atomic blocks and transactional memory. 57-66
  
• Luke Dalessandro, Michael F. Spear, Michael L. Scott:
  NOrec: streamlining STM by abolishing ownership records. 67-78
  
• Walther Maldonado, Patrick Marlier, Pascal Felber, Adi Suissa, Danny Hendler, Alexandra Fedorova, Julia L. Lawall, Gilles Muller:
  Scheduling support for transactional memory contention management. 79-90
  
• João Barreto, Aleksandar Dragojevic, Paulo Ferreira, Rachid Guerraoui, Michal Kapalka:
  Leveraging parallel nesting in transactional memory. 91-100
  

Panel

• Josep Torrellas, Bill Gropp, Jaime H. Moreno, Kunle Olukotun, Vivek Sarkar:
  Extreme scale computing: challenges and opportunities. 101-102
  
• Arvind:
  Is hardware innovation over? 103-104
  

Parallel libraries, applications and tools on GPUs

• Sara S. Baghsorkhi, Matthieu Delahaye, Sanjay J. Patel, William D. Gropp, Wen-mei W. Hwu:
  An adaptive performance modeling tool for GPU architectures. 105-114
  
• JeeWhan Choi, Amik Singh, Richard W. Vuduc:
  Model-driven autotuning of sparse matrix-vector multiply on GPUs. 115-126
  
• Yao Zhang, Jonathan Cohen, John D. Owens:
  Fast tridiagonal solvers on the GPU. 127-136
  
• Edans Flavius de Oliveira Sandes, Alba Cristina Magalhaes Alves de Melo:
  CUDAlign: using GPU to accelerate the comparison of megabase genomic sequences. 137-146
  

Scalable parallel computing

• Steven A. Hofmeyr, Costin Iancu, Filip Blagojevic:
  Load balancing on speed. 147-158
  
• Torsten Hoefler, Christian Siebert, Andrew Lumsdaine:
  Scalable communication protocols for dynamic sparse data exchange. 159-168
  
• John W. Romein, P. Chris Broekema, Jan David Mol, Rob van Nieuwpoort:
  The LOFAR correlator: implementation and performance analysis. 169-178
  

Thread management and scheduling

• Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin:
  Lazy binary-splitting: a run-time adaptive work-stealing scheduler. 179-190
  
• Petar Radojkovic, Vladimir Cakarevic, Javier Verdú, Alex Pajuelo, Francisco J. Cazorla, Mario Nemirovsky, Mateo Valero:
  Thread to strand binding of parallel network applications in massive multi-threaded systems. 191-202
  

Locality-aware parallelism

• Eddy Z. Zhang, Yunlian Jiang, Xipeng Shen:
  Does cache sharing on modern CMP matter to the performance of contemporary multithreaded programs? 203-212
  
• Lixia Liu, Zhiyuan Li:
  Improving parallelism and locality with asynchronous algorithms. 213-222
  
• Anthony M. Castaldo, R. Clint Whaley:
  Scaling LAPACK panel operations using parallel cache assignment. 223-232
  
• Dean F. Sutherland, William L. Scherlis:
  Composable thread coloring. 233-244
  

Locks and concurrent data structures

• Kunal Agrawal, Charles E. Leiserson, Jim Sukha:
  Helper locks for fork-join parallel programming. 245-256
  
• Nathan Grasso Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun:
  A practical concurrent binary search tree. 257-268
  
• Nathan R. Tallent, John M. Mellor-Crummey, Allan Porterfield:
  Analyzing lock contention in multithreaded applications. 269-280
  
• Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai:
  Using data structure knowledge for efficient lock generation and strong atomicity. 281-292
  

Performance modeling and prediction

• Qasim Ali, Samuel P. Midkiff, Vijay S. Pai:
  Modeling advanced collective communication algorithms on cell-based systems. 293-304
  
• Jidong Zhai, Wenguang Chen, Weimin Zheng:
  PHANTOM: predicting performance of parallel applications on large-scale parallel machines using a single node. 305-314
  
• Farhana Aleen, Monirul Sharif, Santosh Pande:
  Input-driven dynamic execution prediction of streaming applications. 315-324
  

Posters

• Daniel Lupei, Bogdan Simion, Don Pinto, Matthew Misler, Mihai Burcea, William Krick, Cristiana Amza:
  Towards scalable and transparent parallelization of multiplayer games using transactional memory support. 325-326
  
• Swann Perarnau, Guillaume Huard:
  KRASH: reproducible CPU load generation on many cores machines. 327-328
  
• Sai Prashanth Muralidhara, Mahmut T. Kandemir, Padma Raghavan:
  Intra-application shared cache partitioning for multithreaded applications. 329-330
  
• Alokika Dash, Brian Demsky:
  Symbolic prefetching in transactional distributed shared memory. 331-332
  
• Dhruva R. Chakrabarti:
  New abstractions for effective performance analysis of STM programs. 333-334
  
• Chao Zhang, Chen Ding, Xiaoming Gu, Kirk Kelsey, Tongxin Bai, Xiaobing Feng:
  Continuous speculative program parallelization in software. 335-336
  
• Vladimir Marjanovic, Jesús Labarta, Eduard Ayguadé, Mateo Valero:
  Effective communication and computation overlap with hybrid MPI/SMPSs. 337-338
  
• Daniel Cederman, Philippas Tsigas:
  Supporting lock-free composition of concurrent data objects. 339-340
  
• Yi Guo, Yisheng Zhao, Vincent Cavé, Vivek Sarkar:
  SLAW: a scalable locality-aware adaptive work-stealing scheduler for multi-core systems. 341-342
  
• Yi Yang, Ping Xiang, Jingfei Kong, Huiyang Zhou:
  An optimizing compiler for GPGPU programs with input-data sharing. 343-344
  
• Aparna Chandramowlishwaran, Kathleen Knobe, Richard W. Vuduc:
  Applying the concurrent collections programming model to asynchronous parallel dense linear algebra. 345-346
  
• Henry Hoffmann, Jonathan Eastep, Marco D. Santambrogio, Jason E. Miller, Anant Agarwal:
  Application heartbeats for software performance and health. 347-348
  
• Donald E. Porter, Emmett Witchel:
  Modeling transactional memory workload performance. 349-350
  
• John D. Carter, William B. Gardner, Gary Gréwal:
  The pilot library for novice MPI programmers. 351-352
  
• Byunghyun Jang, Perhaad Mistry, Dana Schaa, Rodrigo Dominguez, David R. Kaeli:
  Data transformations enabling loop vectorization on multithreaded data parallel architectures. 353-354
  
• Gregory Buehrer, Srinivasan Parthasarathy, Shirish Tatikonda:
  A distributed placement service for graph-structured and tree-structured data. 355-356
  
• Guodong Li, Ganesh Gopalakrishnan, Robert M. Kirby, Dan Quinlan:
  A symbolic verifier for CUDA programs. 357-358
  

Last update Wed May 22 16:21:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page