论文标题
绘制HPC依赖性混乱
Mapping Out the HPC Dependency Chaos
论文作者
论文摘要
高性能计算〜（HPC）软件堆栈已变得复杂，数百个应用程序编号的依赖关系。包装，分发和管理该规模的软件堆栈是任何地方的复杂工作。 HPC系统涉及深奥的编译器，硬件和众多罕见组合。在本文中，我们探讨了可用于包装软件的机制，以在软件分配的分类法上找到自己的依赖性，并讨论其收益和陷阱。我们讨论了通过使用这些组成的堆栈引起的一些常见问题的解决方法，并引入了收缩wrap：一种解决二进制文件的解决方案，该二进制文件可以直接从精确位置和精确顺序加载其依赖性。除了简化二进制文件的使用外，在我们的评估中，该方法还可以加快加载高达7倍的加载。
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.
