Parallel run length encoding compression: Reducing I/O in dynamic environmental simulations

被引:3
|
作者
Davis, G
Lau, L [2 ]
Young, R
Duncalfe, F
Brebber, L
机构
[1] NETSTORM, Brisbane, Qld, Australia
[2] Univ Queensland, Adv Computat Modelling Ctr, Brisbane, Qld 4072, Australia
[3] Queensland Dept Nat Resources, Brisbane, Qld, Australia
关键词
D O I
10.1177/109434209801200402
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Dynamic simulations based on time-varying inputs are extremely I/O intensive, This is shown by industrial applications generating environmental projections based on seasonal-to-interannual climate forecasts that have a compute to data access ratio of O(n) leading to significant performance degradation. Exploitation of compression techniques such as run length encoding (RLE) significantly reduces the I/O bottleneck and storage requirements. Unfortunately, traditional RLE algorithms do not perform well in a parallel vector platform such as the Gray architecture. This paper describes the design and implementation of a new RLE algorithm based on data chunking and packing that exploits the Gray gather-scatter vector hardware and multiple processors. This approach reduces I/O and file storage requirements on average by an order of magnitude. Data intensive applications such as the integration of environmental and global climate models now become practical in a realistic time frame.
引用
收藏
页码:396 / 410
页数:15
相关论文
共 50 条
  • [31] GEOMETRY COMPRESSION FOR TIME-VARYING MESHES USING COARSE AND FINE LEVELS OF QUANTIZATION AND RUN-LENGTH ENCODING
    Han, Seung-Ryong
    Yamasaki, Toshihiko
    Aizawa, Kiyoharu
    2008 15TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1-5, 2008, : 1045 - 1048
  • [32] Reducing I/O complexity by simulating coarse grained parallel algorithms
    Dehne, F
    Hutchinson, D
    Maheshwari, A
    Dittrich, W
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 14 - 20
  • [33] Reducing I/O complexity by simulating coarse grained parallel algorithms
    Dehne, Frank
    Hutchinson, David
    Maheshwari, Anil
    Dittrich, Wolfgang
    Proceedings of the International Parallel Processing Symposium, IPPS, 1999, : 14 - 20
  • [34] Load balance and parallel I/O: Optimising COSA for large simulations
    Jackson, Adrian
    Campobasso, M. Sergio
    Drofelnik, Jernej
    COMPUTERS & FLUIDS, 2018, 173 : 206 - 215
  • [35] ΔRLE: Lossless data compression algorithm using delta transformation and optimized bit-level run-length encoding
    Mados, Branislav
    Bilanova, Zuzana
    Hurtuk, Jan
    JOURNAL OF INFORMATION AND ORGANIZATIONAL SCIENCES, 2021, 45 (01) : 329 - 349
  • [36] Run-Length Encoding (RLE) Data Compression Algorithm Performance Analysis on Climate Datasets for Internet of Things (IoT) Application
    Khairi, Nor Asilah
    Jambek, Asral Bahari
    INTERNATIONAL JOURNAL OF NANOELECTRONICS AND MATERIALS, 2021, 14 : 191 - 197
  • [37] Reducing I/O variability using dynamic I/O path characterization in petascale storage systems
    Son, Seung Woo
    Sehrish, Saba
    Liao, Wei-keng
    Oldfield, Ron
    Choudhary, Alok
    JOURNAL OF SUPERCOMPUTING, 2017, 73 (05): : 2069 - 2097
  • [38] Reducing I/O variability using dynamic I/O path characterization in petascale storage systems
    Seung Woo Son
    Saba Sehrish
    Wei-keng Liao
    Ron Oldfield
    Alok Choudhary
    The Journal of Supercomputing, 2017, 73 : 2069 - 2097
  • [39] Improving I/O Throughput of Scientific Applications using Transparent Parallel Compression
    Bicer, Tekin
    Yin, Jian
    Agrawal, Gagan
    2014 14TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2014, : 1 - 10
  • [40] AN INVESTIGATION OF SCALABLE SIMD I/O TECHNIQUES WITH APPLICATION TO PARALLEL JPEG COMPRESSION
    COOK, GW
    DELP, EJ
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 30 (02) : 111 - 128