Poster Type: ACM SRC Posters
Author: Anthony Cardia (Elmhurst University), Kaushik Velusamy (Argonne National Laboratory), Kevin Brown (Argonne National Laboratory)
Abstract: Deep-learning jobs on exascale systems begin by reading identical files: Python packages, then training data from a shared filesystem, forcing thousands of processes to issue near-identical requests at once and slowing startup for the whole machine. Cooperative caching can relieve this by serving redundant reads locally, but it adds overhead, so it is not always worthwhile. We ask when it pays off.
We characterize Copper, a cooperative read-caching filesystem, against direct Lustre reads on Aurora, measuring PyTorch startup and ResNet-50 dataset loading, cold and warm, from 2 to 2,048 nodes. We find a crossover: as scale grows, Copper's bounded coordination cost overtakes direct reads whose cost climbs with contention. At 2,048 nodes, startup through Copper is ~3× faster cold, ~11× faster warm. Import-torch results are complete; a synthetic file-size guideline is in progress.
The poster presents the crossover and its mechanism, inviting discussion of when cooperative caching should be applied.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF