Approximating Huffman codes in parallel

Piotr Berman, M. Karpinski, Y. Nekrich

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    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 / log n processors, if the elements are sorted.

    Original languageEnglish (US)
    Pages (from-to)479-490
    Number of pages12
    JournalJournal of Discrete Algorithms
    Volume5
    Issue number3
    DOIs
    StatePublished - Sep 1 2007

    Fingerprint

    Huffman Codes
    Parallel algorithms
    Parallel Algorithms
    Sorting
    Linear Algorithm
    Sorting algorithm
    Logarithmic

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics

    Cite this

    Berman, Piotr ; Karpinski, M. ; Nekrich, Y. / Approximating Huffman codes in parallel. In: Journal of Discrete Algorithms. 2007 ; Vol. 5, No. 3. pp. 479-490.
    @article{331cd331f14443b6869b06ff5ea8cb0c,
    title = "Approximating Huffman codes in parallel",
    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 / log n processors, if the elements are sorted.",
    author = "Piotr Berman and M. Karpinski and Y. Nekrich",
    year = "2007",
    month = "9",
    day = "1",
    doi = "10.1016/j.jda.2006.10.007",
    language = "English (US)",
    volume = "5",
    pages = "479--490",
    journal = "Journal of Discrete Algorithms",
    issn = "1570-8667",
    publisher = "Elsevier",
    number = "3",

    }

    Berman, P, Karpinski, M & Nekrich, Y 2007, 'Approximating Huffman codes in parallel', Journal of Discrete Algorithms, vol. 5, no. 3, pp. 479-490. https://doi.org/10.1016/j.jda.2006.10.007

    Approximating Huffman codes in parallel. / Berman, Piotr; Karpinski, M.; Nekrich, Y.

    In: Journal of Discrete Algorithms, Vol. 5, No. 3, 01.09.2007, p. 479-490.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Approximating Huffman codes in parallel

    AU - Berman, Piotr

    AU - Karpinski, M.

    AU - Nekrich, Y.

    PY - 2007/9/1

    Y1 - 2007/9/1

    N2 - 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 / log n processors, if the elements are sorted.

    AB - 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 / log n processors, if the elements are sorted.

    UR - http://www.scopus.com/inward/record.url?scp=34248641143&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=34248641143&partnerID=8YFLogxK

    U2 - 10.1016/j.jda.2006.10.007

    DO - 10.1016/j.jda.2006.10.007

    M3 - Article

    VL - 5

    SP - 479

    EP - 490

    JO - Journal of Discrete Algorithms

    JF - Journal of Discrete Algorithms

    SN - 1570-8667

    IS - 3

    ER -