A survey of repair analysis algorithms for memories

Keewon Cho, Wooheon Kang, Hyungjun Cho, Changwook Lee, Sungho Kang

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Current rapid advancements in deep submicron technologies have enabled the implementation of very large memory devices and embedded memories. However, the memory growth increases the number of defects, reducing the yield and reliability of such devices. Faulty cells are commonly repaired by using redundant cells, which are embedded in memory arrays by adding spare rows and columns. The repair process requires an efficient redundancy analysis (RA) algorithm. Spare architectures for the repair of faulty memory include one-dimensional (1D) spare architectures, two-dimensional (2D) spare architectures, and configurable spare architectures. Of these types, 2D spare architectures, which prepare extra rows and columns for repair, are popular because of their better repairing efficiency than 1D spare architectures and easier implementation than configurable spare architectures. However, because the complexity of the RA is NP-complete, the RA algorithm should consider various factors in order to determine a repair solution. The performance depends on three factors: Analysis time, repair rate, and area overhead. In this article, we survey RA algorithms for memory devices as well as built-in repair algorithms for improving these performance factors. Builtin redundancy analysis techniques for emergent three-dimensional integrated circuits are also discussed. Based on this analysis, we then discuss future research challenges for faulty-memory repair studies.

Original languageEnglish
Article number47
JournalACM Computing Surveys
Volume49
Issue number3
DOIs
Publication statusPublished - 2016 Oct 1

Fingerprint

Algorithm Analysis
Repair
Data storage equipment
Redundancy
Cell
Factor analysis
Integrated Circuits
Factor Analysis
Architecture
NP-complete problem
Defects
Three-dimensional

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cho, Keewon ; Kang, Wooheon ; Cho, Hyungjun ; Lee, Changwook ; Kang, Sungho. / A survey of repair analysis algorithms for memories. In: ACM Computing Surveys. 2016 ; Vol. 49, No. 3.
@article{ccc64489437f4d509c5a0c9e905b6f1b,
title = "A survey of repair analysis algorithms for memories",
abstract = "Current rapid advancements in deep submicron technologies have enabled the implementation of very large memory devices and embedded memories. However, the memory growth increases the number of defects, reducing the yield and reliability of such devices. Faulty cells are commonly repaired by using redundant cells, which are embedded in memory arrays by adding spare rows and columns. The repair process requires an efficient redundancy analysis (RA) algorithm. Spare architectures for the repair of faulty memory include one-dimensional (1D) spare architectures, two-dimensional (2D) spare architectures, and configurable spare architectures. Of these types, 2D spare architectures, which prepare extra rows and columns for repair, are popular because of their better repairing efficiency than 1D spare architectures and easier implementation than configurable spare architectures. However, because the complexity of the RA is NP-complete, the RA algorithm should consider various factors in order to determine a repair solution. The performance depends on three factors: Analysis time, repair rate, and area overhead. In this article, we survey RA algorithms for memory devices as well as built-in repair algorithms for improving these performance factors. Builtin redundancy analysis techniques for emergent three-dimensional integrated circuits are also discussed. Based on this analysis, we then discuss future research challenges for faulty-memory repair studies.",
author = "Keewon Cho and Wooheon Kang and Hyungjun Cho and Changwook Lee and Sungho Kang",
year = "2016",
month = "10",
day = "1",
doi = "10.1145/2971481",
language = "English",
volume = "49",
journal = "ACM Computing Surveys",
issn = "0360-0300",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

A survey of repair analysis algorithms for memories. / Cho, Keewon; Kang, Wooheon; Cho, Hyungjun; Lee, Changwook; Kang, Sungho.

In: ACM Computing Surveys, Vol. 49, No. 3, 47, 01.10.2016.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A survey of repair analysis algorithms for memories

AU - Cho, Keewon

AU - Kang, Wooheon

AU - Cho, Hyungjun

AU - Lee, Changwook

AU - Kang, Sungho

PY - 2016/10/1

Y1 - 2016/10/1

N2 - Current rapid advancements in deep submicron technologies have enabled the implementation of very large memory devices and embedded memories. However, the memory growth increases the number of defects, reducing the yield and reliability of such devices. Faulty cells are commonly repaired by using redundant cells, which are embedded in memory arrays by adding spare rows and columns. The repair process requires an efficient redundancy analysis (RA) algorithm. Spare architectures for the repair of faulty memory include one-dimensional (1D) spare architectures, two-dimensional (2D) spare architectures, and configurable spare architectures. Of these types, 2D spare architectures, which prepare extra rows and columns for repair, are popular because of their better repairing efficiency than 1D spare architectures and easier implementation than configurable spare architectures. However, because the complexity of the RA is NP-complete, the RA algorithm should consider various factors in order to determine a repair solution. The performance depends on three factors: Analysis time, repair rate, and area overhead. In this article, we survey RA algorithms for memory devices as well as built-in repair algorithms for improving these performance factors. Builtin redundancy analysis techniques for emergent three-dimensional integrated circuits are also discussed. Based on this analysis, we then discuss future research challenges for faulty-memory repair studies.

AB - Current rapid advancements in deep submicron technologies have enabled the implementation of very large memory devices and embedded memories. However, the memory growth increases the number of defects, reducing the yield and reliability of such devices. Faulty cells are commonly repaired by using redundant cells, which are embedded in memory arrays by adding spare rows and columns. The repair process requires an efficient redundancy analysis (RA) algorithm. Spare architectures for the repair of faulty memory include one-dimensional (1D) spare architectures, two-dimensional (2D) spare architectures, and configurable spare architectures. Of these types, 2D spare architectures, which prepare extra rows and columns for repair, are popular because of their better repairing efficiency than 1D spare architectures and easier implementation than configurable spare architectures. However, because the complexity of the RA is NP-complete, the RA algorithm should consider various factors in order to determine a repair solution. The performance depends on three factors: Analysis time, repair rate, and area overhead. In this article, we survey RA algorithms for memory devices as well as built-in repair algorithms for improving these performance factors. Builtin redundancy analysis techniques for emergent three-dimensional integrated circuits are also discussed. Based on this analysis, we then discuss future research challenges for faulty-memory repair studies.

UR - http://www.scopus.com/inward/record.url?scp=84993995170&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84993995170&partnerID=8YFLogxK

U2 - 10.1145/2971481

DO - 10.1145/2971481

M3 - Article

VL - 49

JO - ACM Computing Surveys

JF - ACM Computing Surveys

SN - 0360-0300

IS - 3

M1 - 47

ER -