View PDF HTML (experimental)
Abstract:Linking is a critical step in the software build process that combines compiled object files into a single executable or shared library. Despite decades of engineering effort, link times remain a significant bottleneck in the edit-compile-debug cycle, particularly for large C++ programs. Existing linkers exploit limited parallelism, leaving most CPU cores idle during linking. We present mold, a Unix/Linux linker that applies data parallelism systematically across the entire linking pipeline. We first analyze the architectural constraints that prevent existing linkers from scaling, including entangled symbol resolution and archive processing, and then show how a clean-slate design that decouples them overcomes these limitations. On large real-world programs, mold links multi-gigabyte debug binaries in at most a few seconds, and often in under a second. It is 2.4-16.1x faster than the state-of-the-art lld linker, and up to 112x faster than the traditional GNU ld. An ablation study shows that no single optimization dominates; the speedup comes from the cumulative effect of parallelizing all passes.Comments: 15 pages, 3 figures, 10 tables. Accepted to ASPLOS 2027 Subjects: Operating Systems (cs.OS) Cite as: arXiv:2608.23228 [cs.OS] (or arXiv:2608.23228v1 [cs.OS] for this version) https://doi.org/10.48550/arXiv.2608.23228
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Rui Ueyama [view email]
[v1]
Mon, 24 Aug 2026 13:20:03 UTC (82 KB)
