Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st PPOPP 2016: Barcelona, Spain
- Rafael Asenjo, Tim Harris:
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2016, Barcelona, Spain, March 12-16, 2016. ACM 2016, ISBN 978-1-4503-4092-2
Applications
- Marc González Tallada:
Coarse grain parallelization of deep neural networks. 1:1-1:12 - Xiao Wang
, Amit Sabne, Sherman J. Kisner, Anand Raghunathan, Charles A. Bouman, Samuel P. Midkiff:
High performance model based image reconstruction. 2:1-2:12 - Sandeep R. Agrawal, Christopher M. Dee, Alvin R. Lebeck:
Exploiting accelerators for efficient high dimensional similarity search. 3:1-3:12
Language implementation and domain specific languages
- Flávio Cruz, Ricardo Rocha, Seth Copen Goldstein:
Declarative coordination of graph-based parallel programs. 4:1-4:12 - Tyler Denniston, Shoaib Kamil, Saman P. Amarasinghe:
Distributed Halide. 5:1-5:12 - Ryan R. Newton, Ömer S. Agacan, Peter P. Fogg, Sam Tobin-Hochstadt:
Parallel type-checking with haskell using saturating LVars and stream generators. 6:1-6:12
Algorithms
- Lei Wang, Fan Yang, Liangji Zhuang, Huimin Cui, Fang Lv, Xiaobing Feng:
Articulation points guided redundancy elimination for betweenness centrality. 7:1-7:13 - Vincent Bloemen, Alfons Laarman, Jaco van de Pol:
Multi-core on-the-fly SCC decomposition. 8:1-8:12 - Ramakrishnan Kannan, Grey Ballard, Haesun Park:
A high-performance parallel algorithm for nonnegative matrix factorization. 9:1-9:11 - Rezaul Alam Chowdhury, Pramod Ganapathi, Jesmin Jahan Tithi, Charles Bachmeier, Bradley C. Kuszmaul, Charles E. Leiserson, Armando Solar-Lezama, Yuan Tang:
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs. 10:1-10:12
GPUs and scheduling
- Yangzihao Wang, Andrew A. Davidson, Yuechao Pan, Yuduo Wu, Andy Riffel, John D. Owens:
Gunrock: a high-performance graph processing library on the GPU. 11:1-11:12 - Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens:
GPU multisplit. 12:1-12:13 - Tiziano De Matteis, Gabriele Mencagli:
Keep calm and react with foresight: strategies for low-latency and energy-efficient elastic data stream processing. 13:1-13:12 - Jing Li, Kunal Agrawal, Sameh Elnikety, Yuxiong He, I-Ting Angelina Lee, Chenyang Lu, Kathryn S. McKinley:
Work stealing for interactive services to meet target latency. 14:1-14:13
Shared-memory data structures
- Guy L. Steele Jr., Jean-Baptiste Tristan:
Adding approximate counters. 15:1-15:12 - Chaoran Yang, John M. Mellor-Crummey:
A wait-free queue as fast as fetch-and-add. 16:1-16:13 - Syed Kamran Haider, William Hasenplaugh, Dan Alistarh:
Lease/release: architectural support for scaling contended data structures. 17:1-17:12
Optimistic concurrency
- Rachid Guerraoui, Vasileios Trigonakis:
Optimistic concurrency with OPTIK. 18:1-18:12 - Dave Dice, Alex Kogan, Yossi Lev:
Refined transactional lock elision. 19:1-19:12 - Man Cao, Minjia Zhang, Aritra Sengupta, Michael D. Bond:
Drinking from both glasses: combining pessimistic and optimistic tracking of cross-thread dependences. 20:1-20:13
Locking
- Tianzheng Wang, Milind Chabbi, Hideaki Kimura:
Be my guest: MCS lock now welcomes guests. 21:1-21:12 - Milind Chabbi, John M. Mellor-Crummey:
Contention-conscious, locality-preserving locks. 22:1-22:14 - Saurabh Kalikar, Rupesh Nasre:
DomLock: a new multi-granularity locking technique for hierarchies. 23:1-23:12
Consistency models
- Carl G. Ritson, Scott Owens:
Benchmarking weak memory models. 24:1-24:11 - Ganesh Narayanaswamy, Saurabh Joshi, Daniel Kroening:
The virtues of conflict: analysing modern concurrency. 25:1-25:12 - Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Causal consistency: beyond memory. 26:1-26:12
Performance analysis and debugging
- Georgios Chatzopoulos, Aleksandar Dragojevic, Rachid Guerraoui:
ESTIMA: extrapolating scalability of in-memory applications. 27:1-27:11 - Ananya Muddukrishna, Peter A. Jonsson, Artur Podobas, Mats Brorsson:
Grain graphs: OpenMP performance analysis made easy. 28:1-28:13 - Nuno Machado, Brandon Lucia, Luís E. T. Rodrigues:
Production-guided concurrency debugging. 29:1-29:12
Poster abstracts
- Naila Farooqui, Rajkishore Barik, Brian T. Lewis, Tatiana Shpeisman, Karsten Schwan:
Affinity-aware work-stealing for integrated CPU-GPU processors. 30:1-30:2 - François Gindraud, Fabrice Rastello, Albert Cohen, François Broquedis:
An interval constrained memory allocator for the Givy GAS runtime. 31:1-31:2 - Li-Wen Chang, Izzat El Hajj, Hee-Seok Kim, Juan Gómez-Luna, Abdul Dakkak, Wen-mei W. Hwu:
A programming system for future proofing performance critical libraries. 32:1-32:2 - Jesper Puge Nielsen, Sven Karlsson:
A scalable lock-free hash table with open addressing. 33:1-33:2 - Tobias Maier, Peter Sanders, Roman Dementiev:
Concurrent hash tables: fast and general?(!). 34:1-34:2 - Javier Prades, Carlos Reaño, Federico Silla:
CUDA acceleration for Xen virtual machines in infiniband clusters with rCUDA. 35:1-35:2 - Ibrahim Umar, Otto J. Anshus, Phuong Hoai Ha:
Effect of portable fine-grained locality on energy efficiency and performance in concurrent search trees. 36:1-36:2 - Hrushit Parikh, Vinit Deodhar, Ada Gavrilovska, Santosh Pande:
Efficient distributed workstealing via matchmaking. 37:1-37:2 - Hao Luo, Guoyang Chen, Pengcheng Li, Chen Ding, Xipeng Shen:
Data-centric combinatorial optimization of parallel code. 38:1-38:2 - Saeed Maleki, Donald Nguyen, Andrew Lenharth, María Jesús Garzarán, David A. Padua, Keshav Pingali:
DSMR: a shared and distributed memory algorithm for single-source shortest path problem. 39:1-39:2 - Luca Salucci, Daniele Bonetta, Stefan Marr, Walter Binder:
Generic messages: capability-based shared memory parallelism for event-loop systems. 40:1-40:2 - Jianqiao Liu, Nikhil Hegde, Milind Kulkarni:
Hybrid CPU-GPU scheduling and execution of tree traversals. 41:1-41:2 - Arunmoezhi Ramachandran, Neeraj Mittal:
Improving efficacy of internal binary search trees using local recovery. 42:1-42:2 - Duane Merrill, Michael Garland:
Merge-based sparse matrix-vector multiplication (SpMV) using the CSR storage format. 43:1-43:2 - Andi Drebes, Antoniu Pop, Karine Heydemann, Nathalie Drach, Albert Cohen:
NUMA-aware scheduling and memory allocation for data-flow task-parallel applications. 44:1-44:2 - Mohamed Mohamedin, Roberto Palmieri, Sebastiano Peluso, Binoy Ravindran:
On designing NUMA-aware concurrency control for scalable transactional memory. 45:1-45:2 - Mohamed M. Saad, Roberto Palmieri, Binoy Ravindran:
On ordering transaction commit. 46:1-46:2 - Xuehai Qian, Koushik Sen, Paul Hargrove, Costin Iancu:
OPR: deterministic group replay for one-sided communication. 47:1-47:2 - Marco Rabozzi, Matteo Mazzucchelli, Roberto Cordone, Giovanni Matteo Fumarola, Marco D. Santambrogio:
Preemption-aware planning on big-data systems. 48:1-48:2 - Yifeng Chen, Kun Huang, Bei Wang, Guohui Li, Xiang Cui:
Samsara parallel: a non-BSP parallel-in-time model. 49:1-49:2 - Mingzhe Zhang, Francis C. M. Lau, Cho-Li Wang, Luwei Cheng, Haibo Chen:
Scalable adaptive NUMA-aware lock: combining local locking and remote locking for efficient concurrency. 50:1-50:2 - Nikhil Hegde, Jianqiao Liu, Milind Kulkarni:
SPIRIT: a runtime system for distributed irregular tree applications. 51:1-51:2 - Pedro Ramalhete, Andreia Correia:
Tidex: a mutual exclusion lock. 52:1-52:2 - Aristeidis Mastoras, Thomas R. Gross:
Unifying fixed code and fixed data mapping of load-imbalanced pipelined loops. 53:1-53:2 - Mehmet Can Kurt, Bin Ren, Sriram Krishnamoorthy, Gagan Agrawal:
User-assisted storage reuse determination for dynamic task graphs. 54:1-54:2 - Waqas ur Rehman, Muhammad Sohaib Ayub, Junaid Haroon Siddiqui:
Verification of MPI Java programs using software model checking. 55:1-55:2
a service of 
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 2024-05-10 00:57 CEST 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:
