Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarACM Transactions on Parallel Computing, Volume 2
Volume 2, Number 1, May 2015
- Bastian Degener, Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide:
Linear and Competitive Strategies for Continuous Robot Formation Problems. 2:1-2:18 - Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters. 3:1-3:29 - Janmartin Jahn, Santiago Pagani, Sebastian Kobbe, Jian-Jia Chen, Jörg Henkel:
Runtime Resource Allocation for Software Pipelines. 5:1-5:23 - Yi Xu, Bo Zhao, Youtao Zhang, Jun Yang:
Simple Virtual Channel Allocation for High-Throughput and High-Frequency On-Chip Routers. 6:1-6:23 - Adam Hammouda, Andrew R. Siegel, Stephen F. Siegel:
Noise-Tolerant Explicit Stencil Computations for Nonuniform Process Execution Rates. 7:1-7:33 - Ciaran McCreesh, Patrick Prosser:
The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound. 8:1-8:27
Volume 2, Number 2, July 2015
- Torsten Hoefler, James Dinan, Rajeev Thakur, Brian Barrett, Pavan Balaji, William Gropp, Keith D. Underwood:
Remote Memory Access Programming in MPI-3. 9:1-9:26 - Walther Maldonado, Patrick Marlier, Pascal Felber, Julia Lawall, Gilles Muller, Etienne Rivière:
Supporting Time-Based QoS Requirements in Software Transactional Memory. 10:1-10:30 - Gokcen Kestor, Osman S. Unsal, Adrián Cristal, Serdar Tasiran:
TRADE: Precise Dynamic Race Detection for Scalable Transactional Memory Systems. 11:1-11:23 - Nuno Diegues, Paolo Romano:
Time-Warp: Efficient Abort Reduction in Transactional Memory. 12:1-12:44 - Lionel Eyraud-Dubois, Loris Marchal, Oliver Sinnen, Frédéric Vivien:
Parallel Scheduling of Task Trees with Limited Memory. 13:1-13:37
Volume 2, Number 3, October 2015
- Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast Greedy Algorithms in MapReduce and Streaming. 14:1-14:22 - Peter Sanders, Jochen Speck, Raoul Steffen:
Work-Efficient Matrix Inversion in Polylogarithmic Time. 15:1-15:29 - I-Ting Angelina Lee, Charles E. Leiserson, Tao B. Schardl, Zhunping Zhang, Jim Sukha:
On-the-Fly Pipeline Parallelism. 17:1-17:42 - Martina Eikel, Christian Scheideler:
IRIS: A Robust Information System Against Insider DoS Attacks. 18:1-18:33 - Peter Kling, Peter Pietrzyk:
Profitable Scheduling on Multiple Speed-Scalable Processors. 19:1-19:19 - Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-Branching Random Walks on Graphs. 20:1-20:29
Volume 2, Number 4, March 2016
- James R. Larus, Sandhya Dwarkadas, José E. Moreira, Andrew Lumsdaine:
Introduction to the Special Issue on PPoPP'14. 21:1-21:2 - Paul Thomson, Alastair F. Donaldson, Adam Betts:
Concurrency Testing Using Controlled Schedulers: An Empirical Study. 23:1-23:37 - Darko Petrovic, Thomas Ropars, André Schiper:
Leveraging Hardware Message Passing for Efficient Thread Synchronization. 24:1-24:26 - Olivier Tardieu, Benjamin Herta, David Cunningham, David Grove, Prabhanjan Kambadur, Vijay A. Saraswat, Avraham Shinnar, Mikio Takeuchi, Mandana Vaziri, Wei Zhang:
X10 and APGAS at Petascale. 25:1-25:32 - Saeed Maleki, Madanlal Musuvathi, Todd Mytkowicz:
Low-Rank Methods for Parallelizing Dynamic Programming Algorithms. 26:1-26:32 - Xin Yuan, Wickus Nienaber, Santosh Mahapatra:
On Folded-Clos Networks with Deterministic Single-Path Routing. 27:1-27:22 - Edans Flavius de Oliveira Sandes, Guillermo Miranda, Xavier Martorell, Eduard Ayguadé, George Teodoro, Alba Cristina Magalhaes Alves de Melo:
MASA: A Multiplatform Architecture for Sequence Aligners with Block Pruning. 28:1-28:31
maintained by 
, founded at 
, founded at 
last updated on 2019-02-14 22:21 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
