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) and with n processors. This represents a useful improvement since most practical situations satisfy H = O(logn).
Research done in part while visiting Dept. of Computer Science, University of Bonn. Work partially supported by NSF grant CCR-9700053 and DFG grant Bo 56/157-1.
Work partially supported by DFG grants, DIMACS, and IST grant 14036 (RAND-APX).
Work partially supported by IST grant 14036 (RAND-APX).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andersson, A., Hagerup, T., Nilsson, S. Raman, R. Sorting in Linear Time?, Journal of Computer and System Sciences 57 (1998), pp. 74–93
Bhatt, P., Diks, K., Hagerup, T, Prasad, V., T. Radzik, Saxena, S., Improved deterministic parallel integer sorting, Information and Computation 94 (1991), pp. 29–47.
Blelloch, G. Prefix Sums and Their Applications, Reif, J., ed, Synthesis of Parallel Algorithms, pp. 35–60, 1997.
Cole, R. Parallel Merge Sort, SIAM Journal on Computing 17 (1998), pp. 770–785.
Hagerup, T., Toward optimal parallel bucking sorting, Information and Computation 75 (1987), pp. 39–51.
Huffman, D. A. A method for construction of minimum redundancy codes, Proc. IRE, 40 (1951), pp. 1098–1101.
Kirkpatrick, D., Przytycka, T. Parallel Construction of Binary Trees with Near Optimal Weighted Path Length, Algorithmica (1996), pp. 172–192.
Larmore, L.L., Przytycka. T., W. Rytter, Parallel Construction of Optimal Alphabetic Trees, Proc 5th ACM Symposium on Parallel Algorithms and Architectures (1993) pp. 214–223.
Larmore, L., Przytycka. T. Constructing Huffman trees in parallel, SIAM Journal on Computing, 24(6) (1995) pp. 1163–1169.
Miller, G., Reif., J., Parallel tree contraction and its applications, Proc. 26th Symposium on Foundations of Computer Science (1985), pp. 478–489.
Nekrich, Y., Byte-oriented Decoding of Canonical Huffman Codes, Proceedings of the IEEE International Symposium on Information Theory 2000, (2000), p. 371.
Nekrich, Y., Decoding of Canonical Huffman Codes with Look-Up Tables, Proceeding of the IEEE Data Compression Conference 2000, (2000) p. 342.
Teng, S., The construction of Huffman equivalent prefix code in NC, ACM SIGACT 18 (1987), pp. 54–61.
Valiant, L. Parallelism in Comparison Problems, SIAM Journal on Com-puting 4 (1975),pp. 348–355.
van Leeuwen, J. On the construction of Huffman trees, In 3rd Int. Colloqium on Automata, Languages and Programming (1976), pp. 382–410.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, P., Karpinski, M., Nekrich, Y. (2002). Approximating Huffman Codes in Parallel. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_72
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive