2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS) 2016
DOI: 10.1109/icdcs.2016.106
|View full text |Cite
|
Sign up to set email alerts
|

Datacomp: Locally Independent Adaptive Compression for Real-World Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…The Lempel-Ziv scheme puts a pointer into the place of each previewed string. We use a version of Lempel-Ziv that compresses these pointers by Huffman coding (Peterson, 2013). The pointers of Lempel-Ziv look like (345, 8), which means go backward 345 bytes and copy 8 characters.…”
Section: Lempel-ziv Methodsmentioning
confidence: 99%
“…The Lempel-Ziv scheme puts a pointer into the place of each previewed string. We use a version of Lempel-Ziv that compresses these pointers by Huffman coding (Peterson, 2013). The pointers of Lempel-Ziv look like (345, 8), which means go backward 345 bytes and copy 8 characters.…”
Section: Lempel-ziv Methodsmentioning
confidence: 99%
“…A research conducted by Peter et al proposed an adaptive compression system that searches for the most appropriate compression algorithm by considering the type of the target data and system conditions [13]. This system chooses the compression algorithm that maximizes network throughput based on CPU utilization and frequency, available network bandwidth, and data compressibility.…”
Section: Related Workmentioning
confidence: 99%
“…Features related to Huffman coding includes symbol count, symbol frequency distribution, etc. [12], [13], [45], [47].…”
Section: ) Enhanced Heuristic-based Compressibility Predictionmentioning
confidence: 99%
See 2 more Smart Citations