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.
Cost-Driven Data Replication with Predictions
This paper studies an online replication problem for distributed data access. The goal is to dynamically create and delete data copies in a multi-server system as time passes to minimize the total storage and network cost of serving access requests. We ...
Distributed Load Balancing in the Face of Reappearance Dependencies
We consider the problem of load-balancing on distributed databases. We assume that data is divided into chunks and each chunk can be replicated on a constant number d of servers. When a request arrives, it is routed to one of the servers that contains ...
Fast Broadcast in Highly Connected Networks
We revisit the classic broadcast problem, wherein we have k messages, each composed of O(log n) bits, distributed arbitrarily across a network. The objective is to broadcast these messages to all nodes in the network. In the distributed CONGEST model, a ...
PolarStar: Expanding the Horizon of Diameter-3 Networks
We present PolarStar, a novel family of diameter-3 network topologies derived from the star product of low-diameter factor graphs.
PolarStar gives the largest known diameter-3 network topologies for almost all radixes, thus providing the best known ...
PC-oriented Prediction-based Runtime Power Management for GPGPU using Knowledge Transfer
As Moore's law slows down, computing systems must prioritize higher energy efficiency to sustain performance scaling. GPUs have emerged as the primary workhorses of computing resources, making the achievement of high energy efficiency in GPUs a critical ...
Brief Announcement: ROMe: Wait-free Objects for RDMA
Ensuring data consistency under remote direct memory access (RDMA) is challenging due to the combined effects of various hardware components. This brief announcement introduces remote object memory (ROMe), the first technique to guarantee wait-free ...
Brief Announcement: Scalable Distributed String Sorting
String sorting is an important part of tasks such as building index data structures. Unfortunately, current string sorting algorithms do not scale to massively parallel distributed-memory machines since they either have latency (at least) proportional to ...
Brief Announcement: Racos: A Leaderless Erasure Coding State Machine Replication
Cloud storage systems often use state machine replication (SMR) to ensure reliability and availability. Erasure coding has recently been integrated with SMR to reduce disk and network I/O costs. This brief announcement shares our experience in developing ...
