Efficient data reduction and cache-coherent techniques toward real-time performance
ACM SIGGRAPH 2007 courses
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Optimizing sparse matrix-vector multiplication using index and value compression
Proceedings of the 5th conference on Computing frontiers
Wavelet compression with set partitioning for low bandwidth telemetry from AUVs
Proceedings of the Fifth ACM International Workshop on UnderWater Networks
Exploiting compression opportunities to improve SpMxV performance on shared memory systems
ACM Transactions on Architecture and Code Optimization (TACO)
The alpha parallelogram predictor: A lossless compression method for motion capture data
Information Sciences: an International Journal
Assessing the effects of data compression in simulations using physically motivated metrics
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
This paper describes FPC, a lossless compression algorithm for linear streams of 64-bit floating-point data. FPC is designed to compress well while at the same time meeting the high throughput demands of scientific computing environments. On our thirteen datasets, it achieves a substantially higher average compression ratio than BZIP2, DFCM, FSD, GZIP, and PLMI. At comparable compression ratios, it compresses and decompresses 8 to 300 times faster than the other five algorithms.