


default search action
ACM Transactions on Parallel Computing, Volume 8
Volume 8, Number 1, April 2021
- Lee Savoie, David K. Lowenthal, Bronis R. de Supinski, Kathryn M. Mohror, Nikhil Jain:

Mitigating Inter-Job Interference via Process-Level Quality-of-Service. 1:1-1:26 - Tahsin Reza

, Hassan Halawa, Matei Ripeanu, Geoffrey Sanders, Roger A. Pearce:
Scalable Pattern Matching in Metadata Graphs via Constraint Checking. 2:1-2:45
- Jeremy T. Fineman, Aydin Buluç

, Seth Gilbert
:
Introduction to the Special Issue for SPAA 2018: Part 1. 3e:1 - Noga Alon, Yossi Azar, Mark Berlin:

The Price of Bounded Preemption. 3:1-3:21 - Laxman Dhulipala, Guy E. Blelloch, Julian Shun:

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. 4:1-4:70 - Haim Kaplan, Shay Solomon:

Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. 5:1-5:26
Volume 8, Number 2, June 2021
Special Issue on Invited Papers from SPAA 2018: Part 2
- Jeremy T. Fineman, Aydin Buluç, Seth Gilbert:

Introduction to the Special Issue for SPAA 2018 - Part 2. 6:1 - Gopal Pandurangan

, Peter Robinson, Michele Scquizzato:
On the Distributed Complexity of Large-Scale Graph Computations. 7:1-7:28 - Barbara Geissmann, Lukas Gianinazzi:

Parallel Minimum Cuts in Near-linear Work and Low Depth. 8:1-8:20 - Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:

Online Non-preemptive Scheduling on Unrelated Machines with Rejections. 9:1-9:22 - Kjell Winblad, Konstantinos Sagonas

, Bengt Jonsson:
Lock-free Contention Adapting Search Trees. 10:1-10:38
- Oded Green:

HashGraph - Scalable Hash Tables Using a Sparse Graph Data Structure. 11:1-11:17
Volume 8, Number 3, September 2021
- Petra Berenbrink:

Introduction to the Special Issue for SPAA 2019. 12:1 - Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:

Massively Parallel Computation via Remote Memory Access. 13:1-13:25 - Faith Ellen, Barun Gorain, Avery Miller

, Andrzej Pelc:
Constant-Length Labeling Schemes for Deterministic Radio Broadcast. 14:1-14:17 - Michael A. Bender, Alex Conway, Martin Farach-Colton, William Jannen, Yizheng Jiao, Rob Johnson, Eric Knorr, Sara McAllister, Nirjhar Mukherjee, Prashant Pandey, Donald E. Porter, Jun Yuan, Yang Zhan:

External-memory Dictionaries in the Affine and PDAM Models. 15:1-15:20
- Matthias Maier

, Martin Kronbichler
:
Efficient Parallel 3D Computation of the Compressible Euler Equations with an Invariant-domain Preserving Second-order Finite-element Scheme. 16:1-16:30 - James Alexander Edwards, Uzi Vishkin:

Study of Fine-grained Nested Parallelism in CDCL SAT Solvers. 17:1-17:18
Volume 8, Number 4, December 2021
- Laurent Feuilloley, Pierre Fraigniaud:

Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. 18:1-18:25 - Saleh Khalaj Monfared, Omid Hajihassani, Vahid Mohsseni, Dara Rahmati, Saeid Gorgin

:
A High-throughput Parallel Viterbi Algorithm via Bitslicing. 19:1-19:25 - Shao-Chung Wang, Lin-Ya Yu, Li-An Her, Yuan-Shin Hwang, Jenq-Kuen Lee:

Pointer-Based Divergence Analysis for OpenCL 2.0 Programs. 20:1-20:23 - Xuejiao Kang, David F. Gleich, Ahmed H. Sameh, Ananth Grama:

Adaptive Erasure Coded Fault Tolerant Linear System Solver. 21:1-21:19 - Prasad Jayanti, Siddhartha Jayanti:

Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM. 22:1-22:26

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














