EDBT 2026 Demo / reviewers in the wild / expert
Hogyeong Kim
dblp:276/8411
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0003-1177-3853ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021
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 · 67% Electronic design automation · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware reliability and fault tolerance
memory repair |
0.6 | 1 | 2022 | Multibank Optimized Redundancy Analysis Using Efficient Fault Collection · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022 |
Electronic design automation › hardware verification and test
memory testing |
0.6 | 1 | 2022 | Multibank Optimized Redundancy Analysis Using Efficient Fault Collection · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022 |
Hardware reliability and fault tolerance › redundancy
redundancy analysis |
0.6 | 1 | 2022 | Multibank Optimized Redundancy Analysis Using Efficient Fault Collection · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022 |
Methods — techniques the papers use, named apart from their topics
spare structure optimization · 0.6fault storage · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Multibank Optimized Redundancy Analysis Using Efficient Fault CollectionabstractWith technological advancements, the density and capacity of memory are rapidly increasing. As the number of memory cells increases, the difficulty of fault analysis and the number of faults also increase. Hence, the yield and test cost of memory have become essential issues in memory manufacturing. Many manufacturers have used redundancy analysis (RA) to improve the memory yield and decrease the test cost. However, most conventional RA methods require a lengthy analysis time to find a repair solution, and it is difficult to obtain an optimal repair rate with conventional RA algorithms. Although several algorithms using various spare structures to achieve performance improvement have been proposed, those improvements have not been ground breaking. In this article, a new multibank optimized RA (MORA) algorithm is proposed. It achieves a very high repair rate and a drastic reduction in the analysis time compared with conventional RA algorithms using various spare structures. During testing, the proposed algorithm stores the faulty cell information efficiently. Therefore, the analysis time can be shortened through the presolution process of the repair analysis using the proposed fault storage spaces. Additionally, the proposed spare structures are used to increase the repair rate. The experimental results reveal that the proposed algorithm can achieve a very high repair rate at a faster speed than conventional RA algorithms. Hogyeong Kim, Hayoung Lee, Donghyun Han, Sungho Kang 0001 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 2020 | W-ERA: One-Time Memory Repair with Wafer-Level Early Repair Analysis for Cost ReductionabstractSince the probability of fault occurrence on memory has increased with the advance of memory density and capacity, memory repairs in wafer-level and package-level are widely used with redundancy analysis (RA) to improve memory yield. However, as the costs for memory repair also have increased in proportion to the memory density and capacity, the repair costs have occupied a significant portion of the total costs. To address the problem, one-time memory repair with wafer-level early repair analysis (W-ERA) for cost reduction is proposed in this paper. The proposed W-ERA facilitates that all unrepairable memories are classified rapidly without searching memory repair solutions in wafer-level and repairable memory faults occurred in wafer-level are repaired in package-level with additional faults occurred in package-level simultaneously. It means, as the costs of memory repair can be highly reduced since memory repair is skipped in wafer-level, the total costs also can be highly reduced. In addition, memory redundancies can be efficiently used for memory repair in package-level and it results a high repair rate achievement. Hayoung Lee, Donghyun Han, Hogyeong Kim, Sungho Kang 0001 |
ITC-Asia | 3 |