PDATS II: Improved compression of address traces

1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999

Volumn , Issue , 1999, Pages 72-78

  Johnson, E E ^a  

^a New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE;

ADDRESS INFORMATIONS; ADDRESS TRACES; MEMORY REFERENCE TRACES; RUN-LENGTH ENCODING; STORAGE SPACES; TRACE COMPACTIONS; TRACE COMPRESSION;

COMPACTION;

EID: 84962641084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCC.1999.749423     Document Type: Conference Paper

References (7)

1. Hill, M.D., diner0111 documentation, unpublished Unix-style Man Page, University of California, Berkeley, October 1985.
2. Samples, A.D., "Mache: No-Loss Trace Compaction," Proceedings, ACM SIGMETRICS 1989: 89-97.
3. Johnson, E. E. and Ha, J., "PDATS: Lossless Address Trace Compression For Reducing File Size and Access Time," Proc. IEEE International Phoenix Conference on Computers and Communications, 213-219, May 1994.
4. The TraceBase at NMSU can be found at .
5. Welch, T.A., "A Technique for High-Performance Data Compression," IEEE Computer, 17 (6): 8-19, 1984.
6. Ziv, J. and Lempel, A., "A Universal Algorithm for Sequential Data Compression," IEEE Transactions on Information Theory, vol IT-23, No. 3, May 1987.
7. Hennessy, J.L. and D.A. Patterson, Computer Architecture - A Quantitative Approach, Morgan Kaufmann, San Mateo, CA, 1990.