Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jia-Jhe Li

dblp:65/6624 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 57% Memory systems · 43%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
cache design
0.112007
Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties · ACM Trans. Archit. Code Optim. 2007
Energy-efficient computing › leakage power reduction
cache leakage reduction
0.112007
Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties · ACM Trans. Archit. Code Optim. 2007
Energy-efficient computing
leakage power reduction
0.112007
Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties · ACM Trans. Archit. Code Optim. 2007
Energy-efficient computing
power management
0.112007
Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties · ACM Trans. Archit. Code Optim. 2007
Memory systems › cache › cache organization
set-associative cache
0.112007
Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties · ACM Trans. Archit. Code Optim. 2007
Memory systems › cache
instruction and data cache
0.012007
Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties · ACM Trans. Archit. Code Optim. 2007

Methods — techniques the papers use, named apart from their topics

simulation · 0.1
YearPublicationVenuePosition
2012 Case study: stereo vision experiments with multi-core software API on embedded MPSoC environments
Jia-Jhe Li, Chung-Kai Chen, Tung-Yu Wu, Jenq Kuen Lee
J. Supercomput.1
2010 On reducing load/store latencies of cache accesses
Yuan-Shin Hwang, Jia-Jhe Li
J. Syst. Archit.2
2007 Snug set-associative caches: Reducing leakage power of instruction and data caches with no performance penalties
abstract
As transistors keep shrinking and on-chip caches keep growing, static power dissipation resulting from leakage of caches takes an increasing fraction of total power in processors. Several techniques have already been proposed to reduce leakage power by turning off unused cache lines. However, they all have to pay the price of performance degradation. This paper presents a cache architecture, the snug set-associative ( SSA ) cache, that cuts most of static power dissipation of caches without incuring performance penalties. The SSA cache reduces leakage power by implementing the minimum set-associative scheme, which only activates the minimal numbers of ways in each cache set, while the performance losses caused by this scheme are compensated by the base-offset load/store queues . The rationale of combining these two techniques is locality: as the contents of the cache blocks in the current working set are repeatedly accessed, same addresses would be computed again and again. The SSA cache architecture can be applied to data and instruction caches to reduce leakage power without incurring performance penalties. Experimental results show that SSA can cut static power consumption of the L1 data cache by 93%, on average, for SPECint2000 benchmarks, while the execution times are reduced by 5%. Similarly, SSA can cut leakage dissipation of the L1 instruction cache by 92%, on average, and improve performance over 3%. Furthermore, when SSA is adopted for both L1 data and instruction caches, the normalized leakage of L1 data and instruction caches is lowered to 8%, on average, while still accomplishing a 2% reduction in execution times.
Yuan-Shin Hwang, Jia-Jhe Li
ACM Trans. Archit. Code Optim.2
2005 Snug set-associative caches: reducing leakage power while improving performance
abstract
As transistors keep shrinking and on-chip data caches keep growing, static power dissipation due to leakage of caches takes an increasing fraction of total power in processors. Several techniques have already been proposed to reduce leakage power by turning off unused cache lines. However, they all have to pay the price of performance degradation. This paper presents a cache architecture, the snug set-associative (SSA) cache, that does not only cut most of static power dissipation but also reduces execution times. The SSA cache reduces leakage power by implementing the minimum set-associative scheme, which only activates the minimal numbers of ways in each cache set, while the performance losses incurred by this scheme are compensated by the base-offset load/store queues. These two techniques are both developed based on the principle of locality and they work together nicely - experimental results show that the minimum set-associative scheme can cut static power consumption of the L1 data cache by 90% on average for SPECint2000 benchmarks, while the execution times are reduced by 3% when the default 8-entry load/store queue is modified to the base-offset design. Furthermore, the SSA cache can trim the leakage power of L2 data cache by 96% on average while still accomplishing a 3% reduction in execution times.
Jia-Jhe Li, Yuan-Shin Hwang
ISLPED1