Approximating Huffman codes in parallel

Piotr Berman, Marek Karpinski, Yakov Nekrich

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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) and with n processors. This represents a useful improvement since most practical situations satisfy H = O(log n).

    Original languageEnglish (US)
    Title of host publicationAutomata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings
    Pages845-855
    Number of pages11
    StatePublished - Dec 1 2002
    Event29th International Colloquium on Automata, Languages, and Programming, ICALP 2002 - Malaga, Spain
    Duration: Jul 8 2002Jul 13 2002

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2380 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other29th International Colloquium on Automata, Languages, and Programming, ICALP 2002
    CountrySpain
    CityMalaga
    Period7/8/027/13/02

    Fingerprint

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

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Berman, P., Karpinski, M., & Nekrich, Y. (2002). Approximating Huffman codes in parallel. In Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings (pp. 845-855). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2380 LNCS).
    Berman, Piotr ; Karpinski, Marek ; Nekrich, Yakov. / Approximating Huffman codes in parallel. Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. 2002. pp. 845-855 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{15446116ab804372b089d9cf9dd847ca,
    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) and with n processors. This represents a useful improvement since most practical situations satisfy H = O(log n).",
    author = "Piotr Berman and Marek Karpinski and Yakov Nekrich",
    year = "2002",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "3540438645",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "845--855",
    booktitle = "Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings",

    }

    Berman, P, Karpinski, M & Nekrich, Y 2002, Approximating Huffman codes in parallel. in Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2380 LNCS, pp. 845-855, 29th International Colloquium on Automata, Languages, and Programming, ICALP 2002, Malaga, Spain, 7/8/02.

    Approximating Huffman codes in parallel. / Berman, Piotr; Karpinski, Marek; Nekrich, Yakov.

    Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. 2002. p. 845-855 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2380 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Approximating Huffman codes in parallel

    AU - Berman, Piotr

    AU - Karpinski, Marek

    AU - Nekrich, Yakov

    PY - 2002/12/1

    Y1 - 2002/12/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) and with n processors. This represents a useful improvement since most practical situations satisfy H = O(log n).

    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) and with n processors. This represents a useful improvement since most practical situations satisfy H = O(log n).

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

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

    M3 - Conference contribution

    AN - SCOPUS:84869177304

    SN - 3540438645

    SN - 9783540438649

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 845

    EP - 855

    BT - Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings

    ER -

    Berman P, Karpinski M, Nekrich Y. Approximating Huffman codes in parallel. In Automata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings. 2002. p. 845-855. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).