A parallel decoding algorithm for LZ2 data compression

The LZ2 compression method is hardly parallelizable since it is known to be P-complete. In spite of such negative result, we show in this paper that the decoding process can be parallelized efficiently on an EREW PRAM model of computation with O(n/log(n)) processors and O(log2n) time, where n is the...

Full description

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 21; no. 12; pp. 1957 - 1961
Main Author: De Agostino, Sergio
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.1995
Subjects:
Compression algorithm
Decoding
Parallel algorithm
Textual substitution
Textual substitution
Parallel algorithm
Compression algorithm
Decoding
ISSN:0167-8191, 1872-7336
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The LZ2 compression method is hardly parallelizable since it is known to be P-complete. In spite of such negative result, we show in this paper that the decoding process can be parallelized efficiently on an EREW PRAM model of computation with O(n/log(n)) processors and O(log2n) time, where n is the length of the output string.
AbstractList The LZ2 compression method is hardly parallelizable since it is known to be P-complete. In spite of such negative result, we show in this paper that the decoding process can be parallelized efficiently on an EREW PRAM model of computation with O(n/log(n)) processors and O(log2n) time, where n is the length of the output string.
Author De Agostino, Sergio
Author_xml – sequence: 1
  givenname: Sergio
  surname: De Agostino
  fullname: De Agostino, Sergio
  email: deagostino@dsi.uniromal.it
  organization: Computer Science Department, University ‘La Sapienza’, Via Salaria 113, 00198 Rome, Italy
BookMark eNqFkE1LAzEQhoNUsK3-Aw856mF1kmz2w4NQil9Q8KIXL2E2HzWy3ZQkCP57t1Y8eNDDMDDM8zLPzMhkCIMl5JTBBQNWXY5VFw1r2Vkrz4GBgAIOyJQ1NS9qIaoJmf6sHJFZSm8AUJUNTEm1oFuM2Pe2p8bqYPywptivQ_T5dUNdiHT1wqnBjFSHzTbalHwYjsmhwz7Zk-8-J8-3N0_L-2L1ePewXKwKLaDMhew4do5pa1jdStNIgbVsxyGzbdtAV3LtjNBgGOcVOom6RN0Zoy04rptSzMnVPlfHkFK0TmmfMY8X5Ii-VwzU7gNqp6d2eqqV6usDCka4_AVvo99g_PgPu95jdhR79zaqpL0dRgkfrc7KBP93wCd3mXR7
CitedBy_id crossref_primary_10_1016_S0020_0255_01_00100_1
crossref_primary_10_3390_a10010021
crossref_primary_10_1109_ACCESS_2020_3029705
Cites_doi 10.1145/361972.361982
10.1016/0020-0190(91)90223-5
10.1109/MC.1984.1659158
10.1016/0304-3975(94)90106-6
10.1109/TIT.1977.1055714
10.1109/TIT.1976.1055501
ContentType Journal Article
Copyright 1995
Copyright_xml – notice: 1995
DBID AAYXX
CITATION
DOI 10.1016/0167-8191(95)01030-0
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7336
EndPage 1961
ExternalDocumentID 10_1016_0167_8191_95_01030_0
0167819195010300
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1~.
1~5
29O
4.4
457
4G.
5VS
6OB
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
KOM
LG9
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SCC
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
WH7
WUQ
XPP
ZMT
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c304t-5b2abf1ced1795d853a759b2a1e9980b42cfd3c0d1226af5ac4acbddce0f2c843
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=0167819195010300&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-8191
IngestDate Sat Nov 29 03:58:55 EST 2025
Tue Nov 18 22:26:14 EST 2025
Fri Feb 23 02:30:41 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 12
Keywords Textual substitution
Parallel algorithm
Compression algorithm
Decoding
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c304t-5b2abf1ced1795d853a759b2a1e9980b42cfd3c0d1226af5ac4acbddce0f2c843
PageCount 5
ParticipantIDs crossref_citationtrail_10_1016_0167_8191_95_01030_0
crossref_primary_10_1016_0167_8191_95_01030_0
elsevier_sciencedirect_doi_10_1016_0167_8191_95_01030_0
PublicationCentury 1900
PublicationDate 1995-12-01
PublicationDateYYYYMMDD 1995-12-01
PublicationDate_xml – month: 12
  year: 1995
  text: 1995-12-01
  day: 01
PublicationDecade 1990
PublicationTitle Parallel computing
PublicationYear 1995
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Welch (BIB9) 1984; 17
Lempel, Ziv (BIB6) 1977; 23
Ziv, Lempel (BIB10) 1978; 24
Hartman, Rodeh (BIB3) 1985
Hirschberg, Stauffer (BIB4) 1994
Wagner (BIB8) 1973; 16
Lempel, Ziv (BIB5) 1976; 22
Crochemore, Rytter (BIB1) 1991; 38
De Agostino (BIB2) 1994; 127
Miller, Wegman (BIB7) 1985
De Agostino (10.1016/0167-8191(95)01030-0_BIB2) 1994; 127
Welch (10.1016/0167-8191(95)01030-0_BIB9) 1984; 17
Ziv (10.1016/0167-8191(95)01030-0_BIB10) 1978; 24
Wagner (10.1016/0167-8191(95)01030-0_BIB8) 1973; 16
Hirschberg (10.1016/0167-8191(95)01030-0_BIB4) 1994
Lempel (10.1016/0167-8191(95)01030-0_BIB5) 1976; 22
Lempel (10.1016/0167-8191(95)01030-0_BIB6) 1977; 23
Crochemore (10.1016/0167-8191(95)01030-0_BIB1) 1991; 38
Hartman (10.1016/0167-8191(95)01030-0_BIB3) 1985
Miller (10.1016/0167-8191(95)01030-0_BIB7) 1985
References_xml – volume: 17
  start-page: 8
  year: 1984
  end-page: 19
  ident: BIB9
  article-title: A technique for high-performance data compression
  publication-title: IEEE Computer
– volume: 38
  start-page: 57
  year: 1991
  end-page: 60
  ident: BIB1
  article-title: Efficient parallel algorithms to test square-freeness and factorize strings
  publication-title: Information Processing Letters
– volume: 23
  start-page: 337
  year: 1977
  end-page: 343
  ident: BIB6
  article-title: A universal algorithm for sequential data compression
  publication-title: IEEE Trans Information Theory
– volume: 24
  start-page: 531
  year: 1978
  end-page: 536
  ident: BIB10
  article-title: Compression of individual sequences via variable rate coding
  publication-title: IEEE Trans Information Theory
– volume: 127
  start-page: 181
  year: 1994
  end-page: 186
  ident: BIB2
  article-title: P-complete problems in data compression
  publication-title: Theoretical Computer Science
– start-page: 131
  year: 1985
  end-page: 140
  ident: BIB7
  article-title: Variations on theme by Ziv-Lempel
  publication-title: Combinatorial Algorithms on Words
– volume: 22
  start-page: 75
  year: 1976
  end-page: 81
  ident: BIB5
  article-title: On the complexity of finite sequences
  publication-title: IEEE Trans Information Theory
– start-page: 136
  year: 1994
  end-page: 145
  ident: BIB4
  article-title: Parsing algorithms for dictionary compression on the PRAM
  publication-title: Proc. IEEE Data Compression Conf.
– volume: 16
  start-page: 148
  year: 1973
  end-page: 152
  ident: BIB8
  article-title: Common phrases and minimum text storage
  publication-title: Commun ACM
– start-page: 155
  year: 1985
  end-page: 167
  ident: BIB3
  article-title: Optimal parsing of strings
  publication-title: Combinatorial Algorithms on Words
– volume: 24
  start-page: 531
  year: 1978
  ident: 10.1016/0167-8191(95)01030-0_BIB10
  article-title: Compression of individual sequences via variable rate coding
  publication-title: IEEE Trans Information Theory
– volume: 16
  start-page: 148
  year: 1973
  ident: 10.1016/0167-8191(95)01030-0_BIB8
  article-title: Common phrases and minimum text storage
  publication-title: Commun ACM
  doi: 10.1145/361972.361982
– volume: 38
  start-page: 57
  year: 1991
  ident: 10.1016/0167-8191(95)01030-0_BIB1
  article-title: Efficient parallel algorithms to test square-freeness and factorize strings
  publication-title: Information Processing Letters
  doi: 10.1016/0020-0190(91)90223-5
– start-page: 136
  year: 1994
  ident: 10.1016/0167-8191(95)01030-0_BIB4
  article-title: Parsing algorithms for dictionary compression on the PRAM
– volume: 17
  start-page: 8
  year: 1984
  ident: 10.1016/0167-8191(95)01030-0_BIB9
  article-title: A technique for high-performance data compression
  publication-title: IEEE Computer
  doi: 10.1109/MC.1984.1659158
– volume: 127
  start-page: 181
  year: 1994
  ident: 10.1016/0167-8191(95)01030-0_BIB2
  article-title: P-complete problems in data compression
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(94)90106-6
– volume: 23
  start-page: 337
  year: 1977
  ident: 10.1016/0167-8191(95)01030-0_BIB6
  article-title: A universal algorithm for sequential data compression
  publication-title: IEEE Trans Information Theory
  doi: 10.1109/TIT.1977.1055714
– start-page: 131
  year: 1985
  ident: 10.1016/0167-8191(95)01030-0_BIB7
  article-title: Variations on theme by Ziv-Lempel
– volume: 22
  start-page: 75
  year: 1976
  ident: 10.1016/0167-8191(95)01030-0_BIB5
  article-title: On the complexity of finite sequences
  publication-title: IEEE Trans Information Theory
  doi: 10.1109/TIT.1976.1055501
– start-page: 155
  year: 1985
  ident: 10.1016/0167-8191(95)01030-0_BIB3
  article-title: Optimal parsing of strings
SSID ssj0006480
Score 1.4487263
Snippet The LZ2 compression method is hardly parallelizable since it is known to be P-complete. In spite of such negative result, we show in this paper that the...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 1957
SubjectTerms Compression algorithm
Decoding
Parallel algorithm
Textual substitution
Title A parallel decoding algorithm for LZ2 data compression
URI https://dx.doi.org/10.1016/0167-8191(95)01030-0
Volume 21
WOSCitedRecordID wos0167819195010300&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-7336
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006480
  issn: 0167-8191
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Na9wwEBVt0kMv_S5NmxQdWkhYRCVbXltHE1KaEkIOCSy5GHkkbwOON2y2JT-_I1nymhDS5pCLMcKSd_3kN2_kGQ0hX-rGCAViymqpayYbkzKdg2bWctXkgBax8InCR_nxcTGbqZNQaPzalxPIu664uVFXjwo1tiHYLnX2AXAPg2IDniPoeETY8fhfwJcTt51329p2YtC39Ekrup0vlherX5c-qvDoPJm4yFAfT97HwXZjkXoS-4Mv-RCNm5O7dlLOF8gKvmC3I5p5H8fVLxz4ROx1EEZYS0SOdP7amAwTMQY9GVGbUP1O0sFM4psr7qTgfjVgGBx1ssq-uq-1SCeMr81O_NR-yxoNMYIx_MyNVLmRKpVVfpSKPyWbSZ4pZLHN8vBg9nOwvVPpa-UNd4_JkmL6bWjbVdle-DV3i5GRwDh9RV4Ez4CWPaKvyRPbvSEvY9UNGkj4LZmWNAJMI8B0AJgiwBQBpg5gOgL4HTn7fnC6_4OF6hcMUi5XLKsTXTcCrEHOzAzKKo1_GRuFRReZ1zIBfLOAG4EKWjeZBqmhNgYsbxIoZPqebHSLzn4gVOoUPU0NVmv0pwtbcN0UEqUjcJAczBZJ42OoIGwN7yqUtNV9IGwRNvS66rdG-cf1eXzCVZB3vWyrcOrc2_PjA-_0iTxfT_htsrFa_rY75Bn8WV1cLz-HOfMXqhZoNg
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+parallel+decoding+algorithm+for+LZ2+data+compression&rft.jtitle=Parallel+computing&rft.au=De+Agostino%2C+Sergio&rft.date=1995-12-01&rft.issn=0167-8191&rft.volume=21&rft.issue=12&rft.spage=1957&rft.epage=1961&rft_id=info:doi/10.1016%2F0167-8191%2895%2901030-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_0167_8191_95_01030_0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-8191&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-8191&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-8191&client=summon