메뉴 건너뛰기




Volumn 45, Issue 2, 1996, Pages 274-284

Performance evaluation of a reconfiguration-algorithm for memory arrays containing clustered faults

Author keywords

Bound algorithm; Branch ; Clustered fault model; Defect; Memory reconfiguration; Spare

Indexed keywords

CELLULAR ARRAYS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; DEFECTS; ELECTRONIC EQUIPMENT MANUFACTURE; OPTIMIZATION; PERFORMANCE; PROBABILITY; REPAIR;

EID: 0030166218     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.510815     Document Type: Article
Times cited : (27)

References (19)
  • 1
    • 0026172188 scopus 로고    scopus 로고
    • st Int'l Symp. Fault-Tolerant Computing, 1991
    • st Int'l Symp. Fault-Tolerant Computing, 1991, pp 444-451.
    • Pp 444-451.
    • Blough, D.M.1
  • 3
    • 0000182415 scopus 로고    scopus 로고
    • A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
    • 23, 1952, pp 493-507.
    • H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals Mathematical Statistics, vol 23, 1952, pp 493-507.
    • Annals Mathematical Statistics, Vol
    • Chernoff, H.1
  • 15
    • 84938162176 scopus 로고    scopus 로고
    • Cost-size optima for monolithic integrated circuits
    • 52, 1964 Dec, pp 1537-1545.
    • B. Murphy, Cost-size optima for monolithic integrated circuits, Proc. IEEE, vol 52, 1964 Dec, pp 1537-1545.
    • Proc. IEEE, Vol
    • Murphy, B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.