paper-with-me

Papers

Vectorized VByte Decoding

2015-02-20 · Jeff Plaisance, Nathan Kurz, Daniel Lemire

We consider the ubiquitous technique of VByte compression, which represents each integer as a variable length sequence of bytes. The low 7 bits of each byte encode a portion of the integer, and the high bit of each byte is reserved as a continuation flag. This flag is set to 1 for all bytes except the last, and the decoding of each integer is complete when a byte with a high bit of 0 is encountered. VByte decoding can be a performance bottleneck especially when the unpredictable lengths of the encoded integers cause frequent branch mispredictions. Previous attempts to accelerate VByte decoding using SIMD vector instructions have been disappointing, prodding search engines such as Google to use more complicated but faster-to-decode formats for performance-critical code. Our decoder (Masked VByte) is 2 to 4 times faster than a conventional scalar VByte decoder, making the format once again competitive with regard to speed.

📄 PDF Abstract BibTeX arXiv:1503.07387

Code (2)

lemire/MaskedVByte 공식 구현
as-com/varint-simd

Tasks

Decoder

Similar Papers 제목 키워드 기반

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…

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

Segment-Level Vectorized Beam Search Based on Partially Autoregressive Inference

2023-09-26 · Masao Someki, Nicholas Eng, Yosuke Higuchi, Shinji Watanabe

Attention-based encoder-decoder models with autoregressive (AR) decoding have proven to be the dominant approach for automatic speech recognition (ASR) due to their superior accuracy. However, they often suffer from slow…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Decoderspeech-recognition+1

A General SIMD-based Approach to Accelerating Compression Algorithms

2015-02-06 · Wayne Xin Zhao, Xu-Dong Zhang, Daniel Lemire, Dongdong Shan 외

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 …

ScalableMap: Scalable Map Learning for Online Long-Range Vectorized HD Map Construction

2023-10-20 · Jingyi Yu, Zizhao Zhang, Shengfu Xia, Jizhang Sang

We propose a novel end-to-end pipeline for online long-range vectorized high-definition (HD) map construction using on-board camera sensors. The vectorized representation of HD maps, employing polylines and polygons to r…

3D Lane Detectionobject-detectionObject Detection