메뉴 건너뛰기




Volumn 16, Issue , 2004, Pages 559-564

Parallel data compression with bzip2

Author keywords

Data Compression; Parallel Algorithms; Parallel Computing; Software Tools

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER ARCHITECTURE; DATA COMPRESSION; DATA STORAGE EQUIPMENT; MATHEMATICAL TRANSFORMATIONS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; STATISTICAL METHODS;

EID: 11844281485     PISSN: 10272658     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (52)

References (12)
  • 1
    • 0003573193 scopus 로고
    • A block-sorting loss-less data compression algorithm
    • M. Burrows and D. J. Wheeler. A block-sorting loss-less data compression algorithm. Technical Report 124, 1994.
    • (1994) Technical Report , vol.124
    • Burrows, M.1    Wheeler, D.J.2
  • 2
    • 0031705072 scopus 로고    scopus 로고
    • Higher compression from the burrows-wheeler transform by modified sorting
    • Brenton Chapin and Stephen R. Tate. Higher compression from the burrows-wheeler transform by modified sorting. In Data Compression Conference, page 532, 1998.
    • (1998) Data Compression Conference , pp. 532
    • Chapin, B.1    Tate, S.R.2
  • 3
    • 0021405335 scopus 로고
    • Data compression using adaptive coding and partial string matching
    • April
    • J. G. Cleary and I. H. Witten. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications, COM-32(4):396-402, April 1984.
    • (1984) IEEE Transactions on Communications , vol.COM-32 , Issue.4 , pp. 396-402
    • Cleary, J.G.1    Witten, I.H.2
  • 4
    • 0032686420 scopus 로고    scopus 로고
    • Universal lossless source coding with the burrows wheeler transform
    • Michelle Effros. Universal lossless source coding with the burrows wheeler transform. In Data Compression Conference, pages 178-187, 1999.
    • (1999) Data Compression Conference , pp. 178-187
    • Effros, M.1
  • 6
    • 11844260216 scopus 로고    scopus 로고
    • Parallel compression with cooperative dictionary construction. U.S. Patent No. 5,729,228
    • P. Franaszek, J. Robinson, and J. Thomas. Parallel compression with cooperative dictionary construction. U.S. Patent No. 5,729,228, 1998.
    • (1998)
    • Franaszek, P.1    Robinson, J.2    Thomas, J.3
  • 8
    • 84055167898 scopus 로고
    • Arithmetic coding for data compression
    • Paul G. Howard and Jeffery Scott Vitter. Arithmetic coding for data compression. Technical Report Technical report DUKE-TR-1994-09, 1994.
    • (1994) Technical Report , vol.DUKE-TR-1994-09
    • Howard, P.G.1    Vitter, J.S.2
  • 10
    • 11844294201 scopus 로고
    • Parallel text compression - Revised
    • Lynn M. Stauffer and Daniel S. Hirschberg. Parallel text compression - REVISED. Technical Report ICS-TR-91-44, 1993.
    • (1993) Technical Report , vol.ICS-TR-91-44
    • Stauffer, L.M.1    Hirschberg, D.S.2
  • 11
    • 11844306774 scopus 로고
    • Dictionary compression on the PRAM
    • Lynn M. Stauffer and Daniel S. Hirschberg. Dictionary compression on the PRAM. Technical Report ICS-TR-94-07, 1994.
    • (1994) Technical Report , vol.ICS-TR-94-07
    • Stauffer, L.M.1    Hirschberg, D.S.2
  • 12
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • Jacob Ziv and Abraham Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.