Runway: In-transit Data Compression on Heterogeneous HPC Systems

被引:1
|
作者
Ravi, John [1 ]
Byna, Suren [2 ]
Becchi, Michela [1 ]
机构
[1] North Carolina State Univ, Raleigh, NC 27695 USA
[2] Ohio State Univ, Columbus, OH USA
基金
美国国家科学基金会;
关键词
Object Data Management; In-transit Computation; Heterogeneous Resources;
D O I
10.1109/CCGRID57682.2023.00030
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To alleviate bottlenecks in storing and accessing data on high-performance computing (HPC) systems, I/O libraries are enabling computation while data is in-transit, such as HDF5 filters. For scientific applications that commonly use floatingpoint data, error-bounded lossy compression methods are a critical technique to significantly reduce the storage and bandwidth requirements. Thus far, deciding when and where to schedule in-transit data transformations, such as compression, has been outside the scope of I/O libraries. In this paper, we introduce Runway, a runtime framework that enables computation on in-transit data with an object storage abstraction. Runway is designed to be extensible to execute userdefined functions at runtime. In this effort, we focus on studying methods to offload data compression operations to available processing units based on latency and throughput. We compare the performance of running compression on multi-core CPUs, as well as offloading it to a GPU and a Data Processing Unit (DPU). We implement a state-of-the-art error-bounded lossy compression algorithm, SZ3, as a Runway function with a variant optimized for DPUs. We propose dynamic modeling to guide scheduling decisions for in-transit data compression. We evaluate Runway using four scientific datasets from the SDRBench benchmark suite on a the Perlmutter supercomputer at NERSC.
引用
收藏
页码:229 / 239
页数:11
相关论文
共 50 条
  • [31] ON CLUSTERING HETEROGENEOUS DATA AND CLUSTERING BY COMPRESSION
    Carstoiu, Dorin
    Cernian, Alexandra
    Sgarciu, Valentin
    Olteanu, Adriana
    ANNALS OF DAAAM FOR 2009 & PROCEEDINGS OF THE 20TH INTERNATIONAL DAAAM SYMPOSIUM, 2009, 20 : 293 - 294
  • [32] A data-oriented profiler to assist in data partitioning and distribution for heterogeneous memory in HPC
    Pena, Antonio J.
    Balaji, Pavan
    PARALLEL COMPUTING, 2016, 51 : 46 - 55
  • [33] Data Placement in HPC Architectures with Heterogeneous Off-chip Memory
    Pavlovic, Milan
    Puzovic, Nikola
    Ramirez, Alex
    2013 IEEE 31ST INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD), 2013, : 193 - 200
  • [34] Fast Error-bounded Lossy HPC Data Compression with SZ
    Di, Sheng
    Cappello, Franck
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016), 2016, : 730 - 739
  • [35] HaDPA: A Data-Partition Algorithm for Data Parallel Applications on Heterogeneous HPC Platforms
    Li, Jingbo
    Han, Li
    Qu, Yuqi
    Zhang, Xingjun
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT II, 2022, 13156 : 178 - 192
  • [36] Exploiting User Activeness for Data Retention in HPC Systems
    Zhang, Wei
    Byna, Suren
    Sim, Hyogi
    Lee, Sangkeun
    Vazhkudai, Sudharshan
    Chen, Yong
    SC21: INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2021,
  • [37] A Diagonal Cabling Approach to Data Center and HPC Systems
    Truong Thao Nguyen
    Fujiwara, Ikki
    Koibuchi, Michihiro
    PROCEEDINGS OF THE SEVENTH SYMPOSIUM ON INFORMATION AND COMMUNICATION TECHNOLOGY (SOICT 2016), 2016, : 265 - 271
  • [38] Data-Driven Job Dispatching in HPC Systems
    Galleguillos, Cristian
    Sirbu, Alina
    Kiziltan, Zeynep
    Babaoglu, Ozalp
    Borghesi, Andrea
    Bridi, Thomas
    MACHINE LEARNING, OPTIMIZATION, AND BIG DATA, MOD 2017, 2018, 10710 : 449 - 461
  • [39] Clustering Heterogeneous Data Using Clustering by Compression
    Cernian, Alexandra
    Carstoiu, Dorin
    PROCEEDINGS OF THE 13TH WSEAS INTERNATIONAL CONFERENCE ON COMPUTERS, 2009, : 133 - +
  • [40] Robust multiplexed codes for compression of heterogeneous data
    Jégou, H
    Guillemot, C
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) : 1393 - 1407