Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures

It is our great pleasure to welcome you to the 33rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA 2021. The goal of SPAA is to develop a deeper understanding of parallelism in all its forms, bringing together the theory and practice of parallel computing. With parallel computin...

Descripción completa

Detalles Bibliográficos
Otros Autores: Agrawal, Kunal, author (author), Azar, Yossi, author
Formato: Libro electrónico
Idioma:Inglés
Publicado: New York, NY, USA : ACM 2021.
Colección:ACM Conferences
Materias:
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009714399306719
Descripción
Sumario:It is our great pleasure to welcome you to the 33rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA 2021. The goal of SPAA is to develop a deeper understanding of parallelism in all its forms, bringing together the theory and practice of parallel computing. With parallel computing becoming more widespread with each passing day, SPAA has never been more relevant, and this year's program features research papers that range from highly theoretical to highly practical, and which consider parallelism at all scales, from multicore to massively parallel supercomputers. This year, the call for papers attracted 96 submissions. The program committee accepted 35 as regular papers (an acceptance rate of 36%). In addition, the program committee decided to accept 13 papers as brief announcements. Our hope is that this number of total acceptances provides an opportunity for our research community to engage in lively virtual discussion, to share ideas, and to advance research in parallel computing. SPAA 2021 is pleased to announce that the best paper award goes to"Parallel Minimum Cuts in O (m log2(n)) Work and Low Depth" by Daniel Anderson and Guy Blelloch. In addition, four other papers have been nominated for the best paper award this year. The nominees are:"Fast Stencil Computations using Fast Fourier Transform" by Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory and Yimin Zhu."Algorithms for Right-Sizing Heterogeneous Data Centers" by Susanne Albers and Jens Quedenfeld."Non-Clairvoyant Scheduling with Predictions" by Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem and Manish Purohit."Low-Span Parallel Algorithms for the Binary-Forking Model" by Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory and Mohammad Javanmard. The committee had its discussion in an online fashion. The program committee responded amazingly and provided high-quality reviews on all papers (although the COVID-19 pandemic was still on). There was a full and timely cooperation by all members of the committee and hence there was no need for an online meeting. The committee ensured that every paper was discussed, even when committee members were separated by several time zones. In the end, every paper received vigorous debate.
Descripción Física:1 online resource (452 pages) : illustrations
Bibliografía:Includes bibliographical references and index.