A performance and energy exploration of dictionary code compression architectures

© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120215
We have made a performance and energy exploration of a previously proposed dictionary code compression mechanism where frequently executed individual instructions and/or sequences are replaced in memory with short code words. Our simulated design shows a dramatically reduced instruction memory access frequency leading to a performance improvement for small instruction cache sizes and to significantly reduced energy consumption in the instruction fetch path. We have evaluated the performance and energy implications of three architectural parameters: branch prediction accuracy, instruction cache size and organization. To asses the complexity of the design we have implemented the critical stages in VHDL.

Brorsson, Mats,1962-KTH,Programvaru- och datorsystem, SCS,Kista Multicore Center(Swepub:kth)u1dkd5v9 (author)
Öberg, JohnnyKTH,Elektroniksystem(Swepub:kth)u1t0l5al (author)
KTHProgramvaru- och datorsystem, SCS (creator_code:org_t)

In:2011 International Green Computing Conference and Workshops (IGCC): IEEE conference proceedings, s. 1-89781457712227

About the subject

NATURAL SCIENCES: NATURAL SCIENCES; and Computer and Inf ...; and Computer Enginee ...

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.