Name
Title | ||
|---|---|---|
A Fine-Grained Parallel Snappy Decompressor for FPGAs Using a Relaxed Execution Model |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/FCCM.2019.00076 | 2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM) |
Keywords | Field | DocType |
Field programmable gate arrays,Engines,Table lookup,Clocks,Throughput,Resource management,Information services | Data dependency,Data transmission,Computer science,Parallel computing,Field-programmable gate array,Execution model,Throughput,Data compression,Security token,Clock rate | Conference |
ISBN | Citations | PageRank |
978-1-7281-1131-5 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Fang | 1 | 186 | 18.77 |
| jianyu chen | 2 | 13 | 5.71 |
| Jinho Lee | 3 | 536 | 47.15 |
| Zaid Al-Ars | 4 | 560 | 78.62 |
| H. P. Hofstee | 5 | 507 | 54.92 |