default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Parallel Computing, Volume 6
Volume 6, Number 1, June 2019
- David A. Bader
:
Editorial from the Editor-in-Chief. 1:1-1:2 - Martin Kronbichler, Karl Ljungkvist:
Multigrid for Matrix-Free High-Order Finite Element Computations on Graphics Processors. 2:1-2:32 - Vincenzo Bonifaci, Andreas Wiese, Sanjoy K. Baruah, Alberto Marchetti-Spaccamela, Sebastian Stiller, Leen Stougie:
A Generalized Parallel Task Model for Recurrent Real-Time Processes. 3:1-3:40 - Hatem Ltaief, Dalal Sukkari, Aniello Esposito, Yuji Nakatsukasa, David E. Keyes:
Massively Parallel Polar Decomposition on Distributed-memory Systems. 4:1-4:15 - Dibakar Saha, Koushik Sinha:
Optimal Schedule for All-to-All Personalized Communication in Multiprocessor Systems. 5:1-5:29
Volume 6, Number 2, September 2019
- Sarunya Pumma, Min Si, Wu-Chun Feng, Pavan Balaji:
Scalable Deep Learning via I/O Analysis and Optimization. 6:1-6:34 - Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre:
I/O Scheduling Strategy for Periodic Applications. 7:1-7:26 - Dimitri Kagaris, Sourav Dutta:
Scheduling Mutual Exclusion Accesses in Equal-Length Jobs. 8:1-8:26 - Md Atiqul Mollah, Wenqi Wang, Peyman Faizian, Md. Shafayat Rahman, Xin Yuan, Scott Pakin, Michael Lang:
Modeling Universal Globally Adaptive Load-Balanced Routing. 9:1-9:23
Volume 6, Number 3, December 2019
- Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Silvio Lattanzi:
Introduction to the Special Issue for SPAA'17. 10:1 - Sudipto Guha, Yi Li, Qin Zhang:
Distributed Partial Clustering. 11:1-11:20 - Pierre Fraigniaud, Dennis Olivetti:
Distributed Detection of Cycles. 12:1-12:20 - Susanne Albers:
On Energy Conservation in Data Centers. 13:1-13:26 - Björn Feldkord, Friedhelm Meyer auf der Heide:
The Mobile Server Problem. 14:1-14:17 - Yossi Azar, Danny Vainstein:
Tight Bounds for Clairvoyant Dynamic Bin Packing. 15:1-15:21 - Colin Cooper, Tomasz Radzik, Nicolas Rivera:
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. 16:1-16:24 - He Sun, Luca Zanetti:
Distributed Graph Clustering and Sparsification. 17:1-17:23 - Shahbaz Khan:
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. 18:1-18:33
Volume 6, Number 4, December 2019
- Lawrence Rauchwerger, Jaejin Lee, Armando Solar-Lezama, Guy L. Steele Jr.:
Introduction to the Special Issue on PPoPP 2017 (Part 1). 19e:1-19e:2 - Tao B. Schardl, William S. Moses, Charles E. Leiserson:
Tapir: Embedding Recursive Fork-join Parallelism into LLVM's Intermediate Representation. 19:1-19:33 - Robert Utterback, Kunal Agrawal, I-Ting Angelina Lee, Milind Kulkarni:
Processor-Oblivious Record and Replay. 20:1-20:28 - Tsung Tai Yeh, Amit Sabne, Putt Sakdhnagool, Rudolf Eigenmann, Timothy G. Rogers:
Pagoda: A GPU Runtime System for Narrow Tasks. 21:1-21:23 - Guy L. Steele Jr., Jean-Baptiste Tristan:
Using Butterfly-patterned Partial Sums to Draw from Discrete Distributions. 22:1-22:30
- Hans Vandierendonck, Dimitrios S. Nikolopoulos:
Hyperqueues: Design and Implementation of Deterministic Concurrent Queues. 23:1-23:35 - Bin Ren, Shruthi Balakrishna, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal, Milind Kulkarni:
Extracting SIMD Parallelism from Recursive Task-Parallel Programs. 24:1-24:37
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-11-08 20:20 CET 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:
