paper-with-me

Papers

A General SIMD-based Approach to Accelerating Compression Algorithms

2015-02-06 · Wayne Xin Zhao, Xu-Dong Zhang, Daniel Lemire, Dongdong Shan, Jian-Yun Nie, Hongfei Yan, Ji-Rong Wen

Compression algorithms are important for data oriented tasks, especially in the era of Big Data. Modern processors equipped with powerful SIMD instruction sets, provide us an opportunity for achieving better compression performance. Previous research has shown that SIMD-based optimizations can multiply decoding speeds. Following these pioneering studies, we propose a general approach to accelerate compression algorithms. By instantiating the approach, we have developed several novel integer compression algorithms, called Group-Simple, Group-Scheme, Group-AFOR, and Group-PFD, and implemented their corresponding vectorized versions. We evaluate the proposed algorithms on two public TREC datasets, a Wikipedia dataset and a Twitter dataset. With competitive compression ratios and encoding speeds, our SIMD-based algorithms outperform state-of-the-art non-vectorized algorithms with respect to decoding speeds.

📄 PDF Abstract BibTeX arXiv:1502.01916

Code (1)

lemire/FastPFor 공식 구현

Similar Papers 제목 키워드 기반

Decoding billions of integers per second through vectorization

2012-09-10 · Daniel Lemire, Leonid Boytsov

In many important applications -- such as search engines and relational database systems -- data is stored in the form of arrays of integers. Encoding and, most importantly, decoding of these arrays consumes considerable…

CPU

Vector operations for accelerating expensive Bayesian computations -- a tutorial guide

2019-02-25 · David J. Warne, Scott A. Sisson, Christopher Drovandi

Many applications in Bayesian statistics are extremely computationally intensive. However, they are often inherently parallel, making them prime targets for modern massively parallel processors. Multi-core and distribute…

Distributed Computing

General Matrix-Matrix Multiplication Using SIMD features of the PIII

2019-11-18 · Douglas Aberdeen, Jonathan Baxter

Generalised matrix-matrix multiplication forms the kernel of many mathematical algorithms. A faster matrix-matrix multiply immediately benefits these algorithms. In this paper we implement efficient matrix multiplication…

SPADE: A SIMD Posit-enabled compute engine for Accelerating DNN Efficiency

2026-01-24 · Sonu Kumar, Lavanya Vinnakota, Mukul Lokhande, Santosh Kumar Vishvakarma 외 arxiv

The growing demand for edge-AI systems requires arithmetic units that balance numerical precision, energy efficiency, and compact hardware while supporting diverse formats. Posit arithmetic offers advantages over floatin…

Stream VByte: Faster Byte-Oriented Integer Compression

2017-09-25 · Daniel Lemire, Nathan Kurz, Christoph Rupp

Arrays of integers are often compressed in search engines. Though there are many ways to compress integers, we are interested in the popular byte-oriented integer compression techniques (e.g., VByte or Google's Varint-GB…