e-journal

A Case for a Value-Aware Cache

---

Replication of values causes poor utilization of on-chip cache memory resources. This paper addresses the question: How much cache resources can be theoretically and practically saved if value replication is eliminated? We introduce the concept of valueaware caches and show that a sixteen times smaller value-aware cache can yield the same miss rate as a conventional cache. We then make a case for a value-aware cache design using Huffman-based compression. Since the value set is rather stable across the execution of an application, one can afford to reconstruct the coding tree in software. The decompression latency is kept short by our proposed novel pipelined Huffman decoder that uses canonical codewords. While the (loose) upper-bound compression factor is 5.2X, we show that, by eliminating cache-block alignment restrictions, it is possible to achieve a compression factor of 3.4X for practical designs.

---

Ketersediaan

Tidak ada salinan data

Informasi Detail

Judul Seri

COMPUTER ARCHITECTURE

No. Panggil

-

Penerbit

- : IEEE Computer Architecture Letters., 2014

Deskripsi Fisik

IEEE COMPUTER ARCHITECTURE LETTERS, VOL. 13, NO. 1, JANUARY- 2014

Bahasa

English

ISBN/ISSN

Digital Object Ident

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

VOL. 13, NO. 1, JANUARY- 2014

Subjek

ARSITEKTUR KOMPUTER

Info Detail Spesifik

-

Pernyataan Tanggungjawab

deliza

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar