2024 Proceeding- General Chair:
- Kunal Agrawal,
- Program Chair:
- Erez Petrank
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.
Scheduling Out-Trees Online to Optimize Maximum Flow
We consider online scheduling. on m identical processors. Jobs are parallel programs constructed using dynamic multithreading (also called fork-join parallelism). Jobs arrive over time online and the goal is to optimize maximum flow. Essentially all ...
Optimizing Dynamic Data Center Provisioning through Speed Scaling: A Primal-Dual Perspective
A significant proportion of energy consumed in modern data centers and clouds is dedicated to provisioning idle servers for maintaining Quality of Service guarantees. Various studies have been conducted exploring dynamic provisioning in data centers with ...
Scheduling Jobs with Work-Inefficient Parallel Solutions
This paper introduces the serial-parallel decision problem. Consider an online scheduler that receives a series of tasks, where each task has both a parallel and a serial implementation. The parallel implementation has the advantage that it can make ...
Multi Bucket Queues: Efficient Concurrent Priority Scheduling
Many irregular algorithms converge more quickly when they execute tasks in a specific order. When this order is discovered at run time, the algorithm demands a dynamic task scheduler. Scaling a priority scheduler to large systems with many cores is ...
A Nearly Quadratic Improvement for Memory Reallocation
In the Memory Reallocation Problem a set of items of various sizes must be dynamically assigned to non-overlapping contiguous chunks of memory. It is guaranteed that the sum of the sizes of all items present at any time is at most a (1-ε)-fraction of the ...
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines
We address optimal makespan-minimizing identical parallel machine scheduling (P||Cmax) by introducing new pruning rules for branch-and-bound (BnB) and integrating them into a prior BnB algorithm. Experimental results indicate that the presented rules are ...
Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms
We study a flexible job scheduling problem. A set of jobs is released over time, each with a starting deadline and a processing length. The jobs are to be started by an online scheduler no later than their starting deadlines and will run nonpreemptively. ...
