HackerPapers

arXiv:2211.05118cs.SE

Mapping Out the HPC Dependency Chaos

Farid Zakaria, Thomas R. W. Scogland, Todd Gamblin, Carlos Maltzahn

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

High Performance Computing~(HPC) software stacks have become complex, with the dependencies of some applications numbering in the hundreds. Packaging, distributing, and administering software stacks of that scale is a complex undertaking anywhere. HPC systems deal with esoteric compilers, hardware, and a panoply of uncommon combinations. In this paper, we explore the mechanisms available for packaging software to find its own dependencies in the context of a taxonomy of software distribution, and discuss their benefits and pitfalls. We discuss workarounds for some common problems caused by using these composed stacks and introduce Shrinkwrap: A solution to producing binaries that directly load their dependencies from precise locations and in a precise order. Beyond simplifying the use of the binaries, this approach also speeds up loading as much as 7x for a large dynamically-linked MPI application in our evaluation.

arXiv comments
Presented at SuperComputing 2022 (https://sc22.supercomputing.org/program/)
Journal reference
DOI
Subjects
cs.SESoftware Engineering cs.MSMathematical Software

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Nov 2022 to Nov 2022. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.