A Case for Partial Co-allocation Constraints in Compressed Caches

• Published in: Embedded Computer Systems: Architectures, Modeling, and Simulation pp. 65 - 77
• Main Authors: Rodrigues Carvalho, Daniel, Seznec, André
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Cache; Cache organization; Hardware compression
• ISBN: 9783031045790; 3031045793
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-031-04580-6_5

Compressed cache layouts require adding the block’s size information to the metadata array. This field can be either constrained—in which case compressed blocks must fit in predetermined sizes; thus, it reduces co-allocation opportunities but has easier management—or unconstrained—in which case compressed blocks can compress to any size; thus, it increases co-allocation opportunities, at the cost of more metadata and latency overheads. This paper introduces the concept of partial constraint, which explores multiple layers of constraint to reduce the overheads of unconstrained sizes, while still allowing a high co-allocation flexibility. Finally, Pairwise Space Sharing (PSS) is proposed, which leverages a special case of a partially constrained system. PSS can be applied orthogonally to compaction methods at no extra latency penalty to increase the cost-effectiveness of their metadata overhead. This concept is compression-algorithm independent, and results in an increase of the effective compression ratios achieved while making the most of the metadata bits. When normalized against compressed systems not using PSS, a compressed system extended with PSS further enhances the average cache capacity of nearly every workload.