检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵雅倩 李龙 郭跃超 史宏志 郭振华 魏士欣 陈继承 ZHAO Yaqian;LI Long;GUO Yuechao;SHI Hongzhi;GUO Zhenhua;WEI Shixin;CHEN Jicheng(State Key Laboratory of High-End Server & Storage Technology(lnspur Group Corporation Limited),Beijing 100085,China)
机构地区:[1]高效能服务器和存储技术国家重点实验室(浪潮集团有限公司),北京100085
出 处:《计算机应用》2018年第A01期112-115,130,共5页journal of Computer Applications
摘 要:目前,数据压缩算法主要基于串行编程模型设计和实现,导致数据压缩速率较低,因而无法满足大数据分析和处理等应用的实时性需求。为了解决这个问题,以常用数据压缩算法Gzip为蓝本,提出一种实现无损数据压缩算法的专用硬件电路。首先,采用多字典并行查找的设计方案提高重复数据的查找速率;接着,采用匹配长度拼接技术提升数据的压缩效果;最后,采用开放计算语言(Open CL)实现了所提出的专用硬件电路。基于现场可编程门阵列(FPGA)进行功能验证和性能评测,结果表明:与基于串行编程模型设计和实现的数据压缩算法相比,所提出的硬件电路在取得适当压缩率的同时,显著地提高了数据的压缩速率,压缩速率可达12 Gb/s。Data compression algorithms are usually designed and implemented by using the sequential programming model, resulting in a very low data compression speed when they are deployed on general-purpose processors, which cannot satisfy the real-time requirement of applications such as big data analytics. To address this problem, a specialized lossless data compression circuit that implemented the Gzip algorithm was proposed. First of all, a parallelized lookup structure with multiple dictionaries was designed to increase the speed of searching for repeated data. Then, a match length splicing technique was proposed to improve the compression ratio. Finally, the circuit was implemented by using Open Computing Language (OpeuCL). Results verified on the Field-Programming Gate Array (FPGA) show that the proposed circuit can achieve moderate compression ratio and dramatically improve the data compression speed, which can be as high as 12 Gb/s.
关 键 词:数据压缩 开放计算语言 Gzip算法 现场可编程门阵列 硬件加速
分 类 号:TP399[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.227.89.143