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.
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 ...
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. ...
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 ...