BlobShuffle reduces shuffling costs by over 40x in Kafka Streams by using object storage for batching with notifications, achieving sub-2s 95th-percentile latency and scaling beyond 2 GiB/s.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Symphony detects step misalignments in ring collectives via lightweight in-network tracking and mitigates them by throttling outpacing flows with congestion signals, yielding up to 54% better communication times in Astra-Sim simulations and a Tofino2 prototype.
citing papers explorer
-
BlobShuffle: Cost-Effective Repartitioning in Stream Processing Systems via Object Storage Exemplified with Kafka Streams
BlobShuffle reduces shuffling costs by over 40x in Kafka Streams by using object storage for batching with notifications, achieving sub-2s 95th-percentile latency and scaling beyond 2 GiB/s.
-
Symphony: Taming Step Misalignments in the Network for Ring-based Collective Operations
Symphony detects step misalignments in ring collectives via lightweight in-network tracking and mitigates them by throttling outpacing flows with congestion signals, yielding up to 54% better communication times in Astra-Sim simulations and a Tofino2 prototype.