Approximating Huffman codes in parallel

Authors:
P. Berman;M. Karpinski;Y. Nekrich
Affiliations:
Department of Computer Science and Engineering, The Pennsylvania State University, USA;Department of Computer Science, University of Bonn, Germany;Department of Computer Science, University of Bonn, Germany
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 10
Cited 0

Towards optimal parallel bucket sorting

Information and Computation
The construction of Huffman-equivalent prefix code in NC

ACM SIGACT News
Hybridsort revisited and parallelized

Information Processing Letters
Improved deterministic parallel integer sorting

Information and Computation
Constructing Huffman Trees in Parallel

SIAM Journal on Computing
Sorting in linear time?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs

SIAM Journal on Computing
A Work Efficient Parallel Algorithm for Constructing Huffman Codes

DCC '99 Proceedings of the Conference on Data Compression
Decoding of Canonical Huffman Codes with Look-Up Tables

DCC '00 Proceedings of the Conference on Data Compression
Parallel tree contraction and its application

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present new results on the approximate parallel construction of Huffman codes. Our algorithm achieves linear work and logarithmic time, provided that the initial set of elements is sorted. This is the first parallel algorithm for that problem with the optimal time and work. Combining our approach with the best known parallel sorting algorithms we can construct an almost optimal Huffman tree with optimal time and work. This also leads to the first parallel algorithm that constructs exact Huffman codes with maximum codeword length H in time O(H) with n/logn processors, if the elements are sorted.