Interframe Compression of Water Dominant Molecular Dynamics Simulations

Molecular dynamics simulations are files containing atomic and molecular data elapsed over time. State-of-the-art in parallel computers are able to generate simulations containing up to 10 million atoms and a large number of frames. These simulations typically hold uncompressed atom coordinates stored in binary format. This report’s main contribution is the development of a system through which compression can be performed. Many simulations contain a large quantity of water molecules which some of our compression schemes attempt to exploit. The compressors that are covered in this report use the temporal properties of the simulation in order to compress files. These are often called Interframe compressors. Five Interframe compression schemes are implemented and tested on several datasets at three different quantisations: 8-bit, 12-bit and 16-bit levels. The datasets were chosen based on properties such as size and the coherence of the motion in the simulation. The test results show that simple delta-based encoding performs well at all quantisation levels. At 8-bit quantisation delta encoding is able to achieve an average of approximately 10% compression rate on across all datasets. However, in the coherent datasets, a much greater compression rate is achieved. A trend that was picked up on was that the greater the number of previous frames, the worse the Interframe compression schemes tend to perform.

[1]  Olivier Devillers,et al.  Geometric compression for interactive transmission , 2000 .

[2]  Jung-Hong Chuang,et al.  Efficient generation of isosurfaces in volume rendering , 1995, Comput. Graph..

[3]  Rida T. Farouki,et al.  Approximation by interval Bezier curves , 1992, IEEE Computer Graphics and Applications.

[4]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[5]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[6]  James E. Gain,et al.  Compression of Dense and Regular Point Clouds , 2006, Comput. Graph. Forum.

[7]  Adam Drozdek Elements Of Data Compression , 2001 .

[8]  Anil K. Jain,et al.  Image data compression: A review , 1981, Proceedings of the IEEE.

[9]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[10]  Hans-Peter Seidel,et al.  Predictive point-cloud compression , 2005, SIGGRAPH '05.

[11]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[12]  Berend Smit,et al.  Understanding molecular simulation: from algorithms to applications , 1996 .

[13]  Jane Wilhelms,et al.  Octrees for faster isosurface generation , 1992, TOGS.

[14]  Rajiv K. Kalia,et al.  Scalable I/O of large-scale molecular dynamics simulations: A data-compression algorithm , 2000 .

[15]  Eric Bodden,et al.  Arithmetic Coding revealed A guided tour from theory to praxis. , 2004 .

[16]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[17]  David G. Stork,et al.  Pattern Classification , 1973 .

[18]  Wu-chi Feng,et al.  A Survey of Application Layer Techniques for Adaptive Streaming of Multimedia , 2001, Real Time Imaging.

[19]  Vijay S. Pande,et al.  Folding@Home and Genome@Home: Using distributed computing to tackle previously intractable problem , 2009, 0901.0866.

[20]  Greg Welch,et al.  An Introduction to Kalman Filter , 1995, SIGGRAPH 2001.

[21]  Peter M. Fenwick,et al.  A new data structure for cumulative frequency tables , 1994, Softw. Pract. Exp..

[22]  Jeffrey Scott Vitter,et al.  Design and analysis of dynamic Huffman codes , 1987, JACM.