版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Hiroshima Univ Dept Informat Engn Kagamiyama 1-4-1 Higashihiroshima Japan
出 版 物:《CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE》
年 卷 期:2017年第29卷第24期
页 面:e4283.1-e4283.12页
核心收录:
学科分类:08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:Grants-in-Aid for Scientific Research Funding Source: KAKEN
主 题:GPGPU lossless data compression parallel algorithms parallel prefix scan
摘 要:There is no doubt that data compression is very important in computer engineering. However, most lossless data compression and decompression algorithms are very hard to parallelize, because they use dictionaries updated sequentially. The main contribution of this paper is to present a new lossless data compression method that we call adaptive loss-less (ALL) data compression. It is designed so that the data compression ratio is moderate, but decompression can be performed very efficiently on the graphics processing unit (GPU). This makes sense for applications such as training of deep learning, in which compressed archived data are decompressed many times. To show the potentiality of ALL data compression method, we have evaluated the running time using five images and five text data and compared ALL with previously published lossless data compression methods implemented in the GPU, Gompresso, CULZSS, and LZW. The data compression ratio of ALL data compression is better than the others for eight data out of these 10 data. Also, our GPU implementation on GeForce GTX1080 GPU for ALL decompression runs 84.0 to 231 times faster than the CPU implementation on Corei7-4790 CPU. Further, it runs 1.22 to 23.5 times faster than Gompresso, CULZSS, and LZW running on the same GPU.