A Fine-Grained Parallel Snappy Decompressor for FPGAs Using a Relaxed Execution Model

2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)(2019)

引用 5|浏览31
暂无评分
摘要
Snappy is a widely used (de) compression algorithm in many big data applications. Such a data compression technique has been proven to be successful to save storage space and to reduce the amount of data transmission from/to storage devices. In this paper, we present a fine-grained parallel Snappy decompressor on FPGAs running under a relaxed execution model that addresses the following main challenges in existing solutions. First, existing designs either can only process one token per cycle or can process multiple tokens per cycle with low area efficiency and/or low clock frequency. Second, the high read-after-write data dependency during decompression introduces stalls which pull down the throughput.
更多
查看译文
关键词
Field programmable gate arrays,Engines,Table lookup,Clocks,Throughput,Resource management,Information services
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络