VLDB 2026 Research / reviewers in the wild / expert
Kaangchil Lee
dblp:66/9201
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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
1 paper |
Hardware reliability and fault tolerance · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware reliability and fault tolerance › memory reliability
built-in redundancy analysis |
0.1 | 1 | 2010 | An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010 |
Hardware reliability and fault tolerance
memory reliability |
0.1 | 1 | 2010 | An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010 |
Hardware reliability and fault tolerance
memory repair |
0.1 | 1 | 2010 | An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010 |
Hardware reliability and fault tolerance › redundancy
redundancy analysis |
0.1 | 1 | 2010 | An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch Analyzer · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010 |
Methods — techniques the papers use, named apart from their topics
parallel node evaluation · 0.1must-repair analysis · 0.1branch analyzer · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | An Advanced BIRA for Memories With an Optimal Repair Rate and Fast Analysis Speed by Using a Branch AnalyzerabstractAs memory capacity and density grow, a corresponding increase in the number of defects decreases the yield and quality of embedded memories for systems-on-chip as well as commodity memories. For embedded memories, built-in redundancy analysis (BIRA) is widely used to solve quality and yield issues by replacing faulty cells with healthy redundant cells. Many BIRA approaches require extra hardware overhead in order to achieve optimal repair rates, or they suffer a loss of repair rate in minimizing the hardware overhead. An innovative BIRA approach is proposed to achieve optimal repair rates, lower area overhead, and increase analysis speed. The proposed BIRA minimizes area overhead by eliminating some storage coverage for only must-repair faulty information. The proposed BIRA analyzes redundancies quickly and efficiently by evaluating all nodes of a branch in parallel with a new analyzer which is simple and easy-to-implement. Experimental results show that the proposed BIRA allows for a much faster analysis speed than that of the state-of-the-art BIRA, as well as the optimal repair rate, and relatively small area overhead. Woosik Jeong, Joohwan Lee, Taewoo Han 0001, Kaangchil Lee, Sungho Kang 0001 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 4 |