CereSZ: Enabling and Scaling Error-bounded Lossy Compression on Cerebras CS-2

15Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Today's scientific applications running on supercomputers produce large volumes of data, leading to critical data storage and communication challenges. To tackle the challenges, error-bounded lossy compression is commonly adopted since it can reduce data size drastically within a user-defined error threshold. Previous work has shown that compression techniques can significantly reduce the storage and I/O overhead while retaining good data quality. However, the existing compressors are mainly designed for CPU and GPU. As new AI chips are being incorporated into supercomputers and increasingly used for accelerating scientific computing, there is a growing demand for efficient data compression on the new architecture. In this paper, we propose an efficient lossy compressor, CereSZ, based on the Cerebras CS-2 system. The compression algorithm is mapped onto Cerebras using both data parallelism and pipeline parallelism. In order to achieve a balanced workload on each processing unit, we propose an algorithm to evenly distribute the pipeline stages. Our experiments with six scientific datasets demonstrate that CereSZ can achieve a throughput from 227.93 GB/s to 773.8 GB/s, 2.43x to 10.98x faster than existing GPU compressors.

Cite

CITATION STYLE

APA

Song, S., Huang, Y., Jiang, P., Yu, X., Zheng, W., Di, S., … Cappello, F. (2024). CereSZ: Enabling and Scaling Error-bounded Lossy Compression on Cerebras CS-2. In HPDC 2024 - Proceedings of the 33rd International Symposium on High-Performance Parallel and Distributed Computing (pp. 309–321). Association for Computing Machinery, Inc. https://doi.org/10.1145/3625549.3658691

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free