{GridGraph}:{Large-Scale} graph processing on a single machine using 2-level hierarchical partitioning
X Zhu, W Han, W Chen - … Annual Technical Conference (USENIX ATC 15 …, 2015 - usenix.org
In this paper, we present GridGraph, a system for processing large-scale graphs on a single
machine. Grid-Graph breaks graphs into 1D-partitioned vertex chunks and 2D-partitioned …
machine. Grid-Graph breaks graphs into 1D-partitioned vertex chunks and 2D-partitioned …
The deep learning solutions on lossless compression methods for alleviating data load on IoT nodes in smart cities
Networking is crucial for smart city projects nowadays, as it offers an environment where
people and things are connected. This paper presents a chronology of factors on the …
people and things are connected. This paper presents a chronology of factors on the …
CDPU: Co-designing compression and decompression processing units for hyperscale systems
General-purpose lossless data compression and decompression ("(de) compression") are
used widely in hyperscale systems and are key" datacenter taxes". However, designing …
used widely in hyperscale systems and are key" datacenter taxes". However, designing …
A fast implementation of deflate
D Harnik, E Khaitzin, D Sotnikov… - 2014 Data …, 2014 - ieeexplore.ieee.org
We present a fast implementation of the Deflate protocol that is substantially faster than the
fastest version of the Zlib software package, yet maintains full compatibility to the Deflate …
fastest version of the Zlib software package, yet maintains full compatibility to the Deflate …
Improving lossy compression for sz by exploring the best-fit lossless compression techniques
In the past decades, various lossy compressors have been studied broadly due to the ever-
increasing volume of data being produced by today's scientific applications. SZ has been …
increasing volume of data being produced by today's scientific applications. SZ has been …
Packet-level network compression: Realization and scaling of the network-wide benefits
The existence of considerable amount of redundancy in the Internet traffic at the packet level
has stimulated the deployment of packet-level redundancy elimination techniques within the …
has stimulated the deployment of packet-level redundancy elimination techniques within the …
Marlin: A high throughput variable-to-fixed codec using plurally parsable dictionaries
We present Marlin, a variable-to-fixed (VF) codec optimized for decoding speed. Marlin
builds upon a novel way of constructing VF dictionaries that maximizes efficiency for a given …
builds upon a novel way of constructing VF dictionaries that maximizes efficiency for a given …
Run-length base-delta encoding for high-speed compression
In modern supercomputers, nodes are connected by networking hardware capable of up to
40 Gb/s. Data compression could allow for even higher effective bandwidth. However, data …
40 Gb/s. Data compression could allow for even higher effective bandwidth. However, data …
Wireless network compression via memory-enabled overhearing helpers
Traces derived from real-world traffic show that significant redundancy exists at the packet
level in mobile network traffic. This has inspired new solutions to suppress the redundancy …
level in mobile network traffic. This has inspired new solutions to suppress the redundancy …
A universal parallel two-pass MDL context tree compression algorithm
N Krishnan, D Baron - IEEE Journal of Selected Topics in …, 2015 - ieeexplore.ieee.org
Computing problems that handle large amounts of data necessitate the use of lossless data
compression for efficient storage and transmission. We present a novel lossless universal …
compression for efficient storage and transmission. We present a novel lossless universal …