JOURNAL ARTICLE

Line sharing cache: Exploring cache capacity with frequent line value locality

Abstract

This paper proposes a new last level cache architecture called line sharing cache (LSC), which can reduce the number of cache misses without increasing the size of the cache memory. It stores lines which contain the identical value in a single line entry, which enables to store greater amount of lines. Evaluation results show performance improvements of up to 35% across a set of SPEC CPU2000 benchmarks.

Keywords:
Cache Computer science Cache algorithms Cache coloring Cache pollution Parallel computing Smart Cache Cache invalidation Spec# Page cache Locality CPU cache Operating system Programming language

Metrics

1
Cited By
0.28
FWCI (Field Weighted Citation Impact)
17
Refs
0.65
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Parallel Computing and Optimization Techniques
Physical Sciences →  Computer Science →  Hardware and Architecture
Advanced Data Storage Technologies
Physical Sciences →  Computer Science →  Computer Networks and Communications
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Frequent value locality and value-centric data cache design

Youtao ZhangJun YangRajiv Gupta

Journal:   ACM SIGPLAN Notices Year: 2000 Vol: 35 (11)Pages: 150-159
JOURNAL ARTICLE

Frequent value locality and value-centric data cache design

Youtao ZhangJun YangRajiv Gupta

Journal:   ACM SIGARCH Computer Architecture News Year: 2000 Vol: 28 (5)Pages: 150-159
JOURNAL ARTICLE

Frequent value locality and value-centric data cache design

Youtao ZhangJun YangRajiv Gupta

Journal:   ACM SIGOPS Operating Systems Review Year: 2000 Vol: 34 (5)Pages: 150-159
© 2026 ScienceGate Book Chapters — All rights reserved.