Introduction to the Special Issue for SPAA?21
Name
3630608.pdf
Size
43.21 KB
Format
Adobe PDF
Checksum (MD5)
42966a997302b1cb355193f2884fd0de
Author(s)
Azar, Yossi
Shun, Julian
Date Issued
December 14, 2023
Journal
ACM Transactions on Parallel Computing
Publisher
ACM
Citation
Yossi Azar and Julian Shun. 2023. Introduction to the Special Issue for SPAA’21. ACM Trans. Parallel Comput.
10, 4, Article 17 (December 2023), 1 pages.
Version
Final published version
Abstract
This special issue of the ACM Transactions on Parallel Computing (TOPC) contains selected papers from the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), which was held July 6-8, 2021. Based on the conference reviews, we invited a selection of the papers accepted at the conference for this special issue. The papers submitted for this special issue then went through TOPC?s own review process. The end result is the following set of outstanding papers in this issue: 1. Daniel Anderson; Guy E Blelloch. Parallel Minimum Cuts in O(m log^2 n) Work and Low Depth 2. Sungjin Im; Ravi Kumar; Mahshid Montazer Qaem; Manish Purohit. Non-Clairvoyant Scheduling with Predictions 3. Susanne Albers; Jens Quedenfeld. Algorithms for Right-Sizing Heterogeneous Data Centers 4. Yannic Maus. Distributed Graph Coloring Made Easy 5. Zafar Ahmad; Rezaul A. Chowdhury; Rathish Das; Pramod Ganapathi; Aaron Gregory; Yimin Zhu. A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier Transforms We thank the authors who prepared mature versions of their papers for this special issue, as well as the reviewers who carefully evaluated the submissions and provided comments that helped improve the papers. Yossi Azar (PC chair) Julian Shun (PC member) Guest Editors
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3630608
