arrow
Return

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

delete1998-12-01
delete4
PRE
AI
G
Geoffrey M. Davis
L
Lawrence Lau *
R
Richard A. Young
F
F. Duncalfe
L
L. Brebber
DOI:10.1177/109434209801200402delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of High Performance Computing Applications cover
International Journal of High Performance Computing Applications
IF:
2.5
Papers:
1.1K
Citations:
1.3K

Organization

No organization information available