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

Kuan-Yu Lai

dblp:123/7050 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · unresolved

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

Systems, architecture and hardware · 4Software engineering, systems software and programming languages · 1

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
2 papers
Energy-efficient computing · 50% Integrated circuit design · 46% Hardware reliability and fault tolerance · 4%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
low-power circuit design
0.422014
Multibit Retention Registers for Power Gated Designs: Concept, Design, and Deployment · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2014
Critical Path Monitor Enabled Dynamic Voltage Scaling for Graceful Degradation in Sub-Threshold Designs · DAC 2014
Energy-efficient computing › voltage scaling
dynamic voltage scaling
0.212014
Critical Path Monitor Enabled Dynamic Voltage Scaling for Graceful Degradation in Sub-Threshold Designs · DAC 2014
Energy-efficient computing
low-power design
0.212014
Multibit Retention Registers for Power Gated Designs: Concept, Design, and Deployment · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2014
Energy-efficient computing
power gating
0.212014
Multibit Retention Registers for Power Gated Designs: Concept, Design, and Deployment · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2014
Integrated circuit design › low-power circuit design
subthreshold circuit design
0.212014
Critical Path Monitor Enabled Dynamic Voltage Scaling for Graceful Degradation in Sub-Threshold Designs · DAC 2014
Energy-efficient computing
leakage power reduction
0.112014
Multibit Retention Registers for Power Gated Designs: Concept, Design, and Deployment · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2014
Hardware reliability and fault tolerance
timing error
0.112014
Critical Path Monitor Enabled Dynamic Voltage Scaling for Graceful Degradation in Sub-Threshold Designs · DAC 2014

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

critical path monitor · 0.2assignment algorithms · 0.2
YearPublicationVenuePosition
2014 Critical Path Monitor Enabled Dynamic Voltage Scaling for Graceful Degradation in Sub-Threshold Designs
abstract
Sub-threshold designs play an important role in energy-constrained applications. In those designs, path delays depend exponentially on threshold voltage/temperature. As such, dynamic configurations at runtime are desired for best trade-off between operating power and performance. Unfortunately, most existing works only consider either process or temperature variations but not both, resulting in sub-optimal configurations or even functional failures. Moreover, little study has been performed on the graceful degradation of sub-threshold designs, which is important in the presence of drastic delay variations. Towards this, we present a novel critical path monitor based dynamic voltage scaling scheme. Considering both process and temperature variations, it minimizes the operating power under a given timing error probability (TEP) bound. An exact method to decide the optimal switching thresholds is also proposed. Experimental results on 45nm industrial designs show that with only 1% TEP, our scheme can reduce the operating power by up to 75.3% compared with the constant voltage scheme. To the best of the authors' knowledge, this is the very first work on dynamic configuration for graceful degradation in sub-threshold designs.
Yu-Guang Chen, Kuan-Yu Lai, Wan-Yu Wen, Yiyu Shi 0001, Shih-Chieh Chang 0001
DAC3
2014 Yield and timing constrained spare TSV assignment for three-dimensional integrated circuits
abstract
Through Silicon Via (TSV) is a critical enabling technique in three-dimensional integrated circuits (3D ICs). However, it may suffer from many reliability issues. Various fault-tolerance mechanisms have been proposed in literature to improve yield, at the cost of significant area overhead. In this paper, we focus on the structure that uses one spare TSV for a group of original TSVs, and study the optimal assignment of spare TSVs under yield and timing constraints to minimize the total area overhead. We show that such problem can be modeled through constrained graph decomposition. An efficient heuristic is further developed to address this problem. Experimental results show that under the same yield and timing constraints, our heuristic can reduce the area overhead induced by the fault-tolerance mechanisms by up to 38%, compared with a seemingly more intuitive nearest-neighbor based heuristic.
Yu-Guang Chen, Kuan-Yu Lai, Ming-Chao Lee, Yiyu Shi 0001, Wing-Kai Hon, Shih-Chieh Chang 0001
DATE2
2014 Multibit Retention Registers for Power Gated Designs: Concept, Design, and Deployment
abstract
Retention registers have been widely used in power gated designs to store data during sleep mode. However, their excessive area and leakage power render it imperative to minimize the total retention storage size. The current industry practice replaces all registers with singlebit retention ones, which significantly limits the design freedom and yields suboptimal designs. Toward this, for the first time in the literature, we propose the concept and the design of multibit retention registers, with which only selected registers need to be replaced. The technique can significantly reduce the number of bits that need to be stored and thus the leakage power, but needs several clock cycles for mode transition. In addition, an efficient assignment algorithm is developed to minimize the total retention storage size subject to mode transition latency constraint. Experimental results show that our framework on average can reduce the leakage power in sleep mode by 84% along with additional mode transition latency of 6 to 11 clock cycles, compared with the singlebit retention register-based design.
Yu-Guang Chen, Hui Geng, Kuan-Yu Lai, Yiyu Shi 0001, Shih-Chieh Chang 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2012 Efficient multiple-bit retention register assignment for power gated design: Concept and algorithms
abstract
Retention registers have been widely used in power gated design to store data during sleep mode. Since they consume much larger area and power than normal registers, it is imperative to minimize the total retention storage size. The current industry practice only replace all registers with single-bit retention ones, which significantly limits the design freedom and results in excessive area and power overhead. Towards this, for the first time in literature, we propose the concept of multi-bit retention register, with which only selected registers need to be replaced. It can significantly reduce the number of bits that need to be stored and thus the area and leakage power, but needs several clock cycles for mode transition. In addition, an efficient assignment algorithm is developed to minimize the total retention storage size subject to mode transition latency constraint. Experimental results show that our framework on average can reduce the leakage power in sleep mode and the retention storage area by 66.03%, compared with the single-bit retention register based design.
Yu-Guang Chen, Yiyu Shi 0001, Kuan-Yu Lai, Hui Geng, Shih-Chieh Chang 0001
ICCAD3