A checkpoint compression study for high-performance computing systems
A checkpoint compression study for high-performance computing systems
复制标题
高性能计算系统的检查点压缩研究
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
D. Arnold
中科院分区：
文献类型：
--
作者：
Dewan Ibtesham;Kurt B. Ferreira;D. Arnold
随着高性能计算系统的规模和复杂性不断增加，检查点/重启 (CR) 协议的更高故障率和增加的开销引起了人们对 CR 协议在未来系统中的实际可行性的担忧。此前，压缩已被证明是减少检查点数据量的可行方法，从而减少 CR 协议开销，从而提高应用程序性能。在本文中，我们通过探索其基线性能和扩展属性，评估改进的压缩算法是否可能带来更好的应用程序性能，并将检查点压缩与其他基于软件和硬件的优化进行比较，进一步探索基于压缩的 CR 优化。我们的结果亮点是：（1）压缩是一种非常可行的 CR 优化； (2) 通用的、基于文本的压缩算法对于检查点数据压缩来说表现得接近最佳，更快的压缩算法不会带来更好的应用程序性能； (3) 基于压缩的优化与其他基于软件的优化相得益彰； (4) 虽然基于硬件的优化优于基于软件的优化，但它们的成本效益较低。
As high-performance computing systems continue to increase in size and complexity, higher failure rates and increased overheads for checkpoint/restart (CR) protocols have raised concerns about the practical viability of CR protocols for future systems. Previously, compression has proven to be a viable approach for reducing checkpoint data volumes and, thereby, reducing CR protocol overhead leading to improved application performance. In this article, we further explore compression-based CR optimization by exploring its baseline performance and scaling properties, evaluating whether improved compression algorithms might lead to even better application performance and comparing checkpoint compression against and alongside other software- and hardware-based optimizations. Our results highlights are that: (1) compression is a very viable CR optimization; (2) generic, text-based compression algorithms appear to perform near optimally for checkpoint data compression and faster compression algorithms will not lead to better application performance; (3) compression-based optimizations fare well against and alongside other software-based optimizations; and (4) while hardware-based optimizations outperform software-based ones, they are not as cost effective.