Poster Type: ACM SRC Posters
Author: Víctor Câmara (Universidade de Brasilia)
Abstract: Task-graph runtimes like Dagger.jl can now run independent tasks across multiple concurrent GPU streams, raising two questions: how should tasks be assigned to streams, and do more streams improve performance regardless of placement?
We benchmark four policies (round-robin, random, SDQ, and locality-aware) across four DAG topologies (linear, diamond, chainlink, tangled) and four stream counts (1, 2, 8, 32) on an NVIDIA H200 and an AMD MI300A. Every policy speeds up with more streams, but placement matters. At 32 streams, round-robin is fastest, averaging 4.5x speedup on H200 and 2.5x on MI300A, with SDQ close behind on H200 (4.0x). Locality-aware assignment issues 1.6x to 8x fewer synchronization events but reaches only 2.5x and 1.5x, so policy choice alone changes wall-clock time by up to 2.2x.
At the poster, we will walk attendees through the DAG-topology taxonomy and policy comparisons, and discuss which policy suits each workload and hardware backend.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF