Speeding up parallel decoding of LZ compressed text on the PRAM EREW

Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Volumn , Issue , 2000, Pages 2-7

  De Agostino, S ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; HEURISTIC METHODS; INFORMATION RETRIEVAL;

COMPRESSION METHODS; P-COMPLETE; PARALLEL DECODER; PARALLEL DECODING; PARALLEL DECODING ALGORITHM; SLIDING WINDOW; SPEED UP;

PARALLEL PROCESSING SYSTEMS;

EID: 84964462294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2000.878174     Document Type: Conference Paper

References (22)

1. D. Belinskaya, S. De Agostino and J. A. Storer. Near Optimal Compression with Respect to a Static Dictionary on a Practical Massively Parallel Architecture. Proc. IEEE Data Compression Conference, 172-181, 1995.
2. T. C. Bell, J. G. Cleary and I. H. Witten. Text Compression. Prentice Hall, 1990.
3. M. Cohn M. and R. Khazan. Parsing with Suffix and Prefix Dictionaries. Proceedings IEEE Data Compression Conference 180-189, 1996.
4. M. Crochemore and W. Rytter W. Efficient Parallel Algorithms to test Square-freeness and factorize Strings. Information Processing Letters, 38: 57-60, 1991.
5. S. De Agostino. P-Complete Problems in Data Compression. Theoretical Computer Science, 127: 181-186, 1994.
6. S. De Agostino. A Parallel Decoding Algorithm for LZ2 Data Compression. Parallel Computing, 21: 1957-1961, 1995.
7. S. De Agostino. A Parallel Decoder for LZ2 Compression using the ID Update Heuristic. IEEE Proceedings Sequences'97, 368-373, 1997.
8. S. De Agostino. Work-Optimal Parallel Decoders for LZ2 Data Compression. Proceedings IEEE Data Compression Conference, 393-399, 2000.
9. M. Farach and S. Muthukrishnan. Optimal Parallel Dictionary Matching and Compression. Proceedings SPAA'95, 244-253, 1995.
10. H. Gazit. An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. Proceedings FOCS'86, 492-501.
11. A. Hartman and M. Rodeh. Optimal Parsing of Strings. A. Apostolico and Z. Galil, ed., Combinatorial Algorithms on Words, Springer - Verlag, 155-167.
12. D. S. Hirschberg and L. M. Stauffer. Parsing Algorithms for Dictionary Compression on the PRAM. Proceedings IEEE Data Compression Conference, 136-145, 1994.
13. A. Lempel and J. Ziv. On the Complexity of Finite Sequences. IEEE Transactions on Information Theory 22: 75-81, 1976.
14. A. Lempel and J. Ziv. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory 23: 337-343, 1977.
15. V. S. Miller and M. N. Wegman. Variations on Theme by Ziv - Lempel. A. Apostolico and Z. Galil, ed., Combinatorial Algorithms on Words, Springer - Verlag, 131-140, 1985.
16. H. Nagumo, M. Lu and K. Watson. Parallel Algorithms for the Static Dictionary Compression. Proceedings IEEE Data Compression Conference 162-171, 1995.
17. M. Naor. String Matching with Preprocessing of Text and Pattern. Proceedings ICALP, LNCS, 739-750.
18. J. A. Storer. Data Compression:Methods and Theory. Computer Science Press, 1988.
19. R. E. Tarjan and U. Vishkin. An Efficient Parallel Biconnectivity Algorithm. SIAM Journal on Computing 14, 862-874, 1985.
20. R. A. Wagner. Common Phrases and Minimum Text Storage. Communications of the ACM, 16, 148-152.
21. T. A. Welch. A Technique for High - Performance Data Compression. IEEE Computer, 17, 8-19.
22. J. Ziv and A. Lempel. Compression of Individual Sequences via Variable Rate Coding. IEEE Transactions on Information Theory, 24, 531-536, 1978.