Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3626183acmconferencesBook PagePublication PagesspaaConference Proceedingsconference-collections
SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
ACM2024 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures Nantes France June 17 - 21, 2024
ISBN:
979-8-4007-0416-1
Published:
17 June 2024
Sponsors:
SIGACT, SIGARCH, EATCS

Bibliometrics
Skip Abstract Section
Abstract

It is our great pleasure to welcome you to the 36th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA 2024. SPAA aims to develop a deeper understanding of parallel and distributed computing, both in theory and in practice. Topics relevant to SPAA include algorithms, data structures, computational models, complexity theory, architectures, performance engineering, languages, runtime systems, compilers, programming systems, and networking systems. This year, there were 125 submissions to SPAA (117 regular submission and 8 brief announcements). The program committee accepted 35 regular papers and 19 brief announcements.

SESSION: Session 9: Scheduling
research-article
Open Access
Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees

In a large, parallel dictionary, performance is dominated by the cache efficiency of its database operations, analyzed theoretically in the DAM model. Write-optimized dictionaries (WODs) are a class of cache-efficient data structures that buffer updates ...

research-article
Free
Hardness and Tight Approximations of Demand Strip Packing

We settle the pseudo-polynomial complexity of the Demand Strip Packing (DSP) problem: Given a strip of fixed width and a set of items with widths and heights, the items must be placed inside the strip with the objective of minimizing the peak height. ...

research-article
Open Access
Online Load and Graph Balancing for Random Order Inputs

Online load balancing for heterogeneous machines aims to minimize the makespan (maximum machine workload) by scheduling arriving jobs with varying sizes on different machines. In the adversarial setting, where an adversary chooses not only the collection ...

Contributors
  • Washington University in St. Louis
  • Technion - Israel Institute of Technology

Recommendations

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%
YearSubmittedAcceptedRate
SPAA '191093431%
SPAA '181203630%
SPAA '171273124%
SPAA '151313124%
SPAA '141223025%
SPAA '131303124%
SPAA '031063836%
SPAA '01933437%
SPAA '00452453%
SPAA '99902629%
SPAA '98843036%
SPAA '97973233%
SPAA '961063937%
SPAA '951013131%
Overall1,46144731%