Analysis of string matching compression algorithms
The improvement rate in microprocessor speed by far exceeds the improvement in DRAM memory. This increasing processor-memory performance gap is the primary obstacle to improved computer system performance. As a result, the size of main memory has increased gradually. To utilize main memory’s resour...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Science Publications
2008
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/13091/ http://psasir.upm.edu.my/id/eprint/13091/1/Analysis%20of%20string%20matching%20compression%20algorithms.pdf |
| _version_ | 1848842016993050624 |
|---|---|
| author | Nadarajan, Krishnaveny Ahmad Zukarnain, Zuriati |
| author_facet | Nadarajan, Krishnaveny Ahmad Zukarnain, Zuriati |
| author_sort | Nadarajan, Krishnaveny |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | The improvement rate in microprocessor speed by far exceeds the improvement in DRAM memory. This increasing processor-memory performance gap is the primary obstacle to improved
computer system performance. As a result, the size of main memory has increased gradually. To utilize main memory’s resources effectively, data compression can be applied. Through compression, the data can be compressed by eliminating redundant elements. Thus, this study incorporates compression to main memory in order to fully utilize its resources and improve performance of data access. This project evaluates the performance of the compression algorithms in order to increase the performance
of memory access. The compression algorithms are string matching based which are LZW and LZSS. Through simulation, the effectiveness and compressibility of the algorithms were compared. The performances of the algorithms were evaluated in term of compression time, decompression time and compressed size. The simulation result shows that LZSS is an efficient compression algorithm compared to LZW. |
| first_indexed | 2025-11-15T07:52:26Z |
| format | Article |
| id | upm-13091 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T07:52:26Z |
| publishDate | 2008 |
| publisher | Science Publications |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-130912015-12-22T04:29:31Z http://psasir.upm.edu.my/id/eprint/13091/ Analysis of string matching compression algorithms Nadarajan, Krishnaveny Ahmad Zukarnain, Zuriati The improvement rate in microprocessor speed by far exceeds the improvement in DRAM memory. This increasing processor-memory performance gap is the primary obstacle to improved computer system performance. As a result, the size of main memory has increased gradually. To utilize main memory’s resources effectively, data compression can be applied. Through compression, the data can be compressed by eliminating redundant elements. Thus, this study incorporates compression to main memory in order to fully utilize its resources and improve performance of data access. This project evaluates the performance of the compression algorithms in order to increase the performance of memory access. The compression algorithms are string matching based which are LZW and LZSS. Through simulation, the effectiveness and compressibility of the algorithms were compared. The performances of the algorithms were evaluated in term of compression time, decompression time and compressed size. The simulation result shows that LZSS is an efficient compression algorithm compared to LZW. Science Publications 2008 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/13091/1/Analysis%20of%20string%20matching%20compression%20algorithms.pdf Nadarajan, Krishnaveny and Ahmad Zukarnain, Zuriati (2008) Analysis of string matching compression algorithms. Journal of Computer Science, 4 (3). pp. 205-210. ISSN 1549-3636 Computer algorithms Data compression (Computer science) English |
| spellingShingle | Computer algorithms Data compression (Computer science) Nadarajan, Krishnaveny Ahmad Zukarnain, Zuriati Analysis of string matching compression algorithms |
| title | Analysis of string matching compression algorithms |
| title_full | Analysis of string matching compression algorithms |
| title_fullStr | Analysis of string matching compression algorithms |
| title_full_unstemmed | Analysis of string matching compression algorithms |
| title_short | Analysis of string matching compression algorithms |
| title_sort | analysis of string matching compression algorithms |
| topic | Computer algorithms Data compression (Computer science) |
| url | http://psasir.upm.edu.my/id/eprint/13091/ http://psasir.upm.edu.my/id/eprint/13091/1/Analysis%20of%20string%20matching%20compression%20algorithms.pdf |