Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/7054
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJanaki, K.-
dc.contributor.authorVijayakumar, P.-
dc.date.accessioned2025-02-03T09:41:52Z-
dc.date.available2025-02-03T09:41:52Z-
dc.date.issued2019-
dc.identifier.citationJanaki,K.; Vijayakumar,P.: An efficient algorithm for a cache compression and decompression to improve system memory performance. Timişoara: Editura Politehnica, 2019.en_US
dc.identifier.issn1582-4594-
dc.identifier.urihttps://dspace.upt.ro/xmlui/handle/123456789/7054-
dc.description.abstractSpeed is the challenging issue for any electronic component. Memory access time is dependent on speed of the microprocessor. Access time is more in the off-chip memory than on-chip memory. In order to increase the speed, cache memory compression technique is found by microprocessor system designers, as it increases the cache capacity and off-chip bandwidth. Performance of the processor, power consumption and area were assumed in previous work on cache compression. A lossless cache compression algorithm is proposed and designed for high performance processor. This technique allows Parallel compression of multiple words using dictionary mode. Compression ratio is not degraded in the performance.en_US
dc.language.isoenen_US
dc.publisherTimișoara : Editura Politehnicaen_US
dc.relation.ispartofseriesJournal of Electrical Engineering;Vol 19 No 2-
dc.subjectCache memory Compressionen_US
dc.subjectData compressionen_US
dc.subjectParallel compression of multiple wordsen_US
dc.titleAn efficient algorithm for a cache compression and decompression to improve system memory performance [articol]en_US
dc.typeArticleen_US
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Janaki_f.pdf695.58 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.