Efficient and optimal fault-to-spare assignments in doubly fault tolerant arrays

Shrivastava, Nisheeth; Melhem, Rami

doi:10.1109/dftvs.1991.199968

[Proceedings] 1991 International Workshop on Defect and Fault Tolerance on VLSI Systems

DOI: 10.1109/dftvs.1991.199968

|View full text |Cite

Efficient and optimal fault-to-spare assignments in doubly fault tolerant arrays

Nisheeth Shrivastava

Rami Melhem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Optimal reconfiguration algorithms for real-time fault-tolerant processor arrays

Libeskind-Hadas

Shrivastava²,

Melhem³

et al. 1995

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Abstract--In this paper we consider the problem of reconfiguring processor arrays subject to computational loads that alternate between two modes. A strict mode is characterized by a heavy computational load and severe constraints on response time while a relaxed mode is characterized by a relatively light computational load and relaxed constraints on response time. In the strict mode, reconfiguration is performed by a distributed local algorithm in order to achieve fast recovery from faults. In the relaxed mode, a global reconfiguration algorithm is used to restore the system to a state that maximizes the probability that future faults occurring in subsequent strict modes will be repairable.Several new results are given for this problem. Efficient reconfiguration algorithms are described for a number of general classes of architectures. These general algorithms obviate the need for architecture-specific algorithms for architectures in these classes. We show that it is unlikely that similar algorithms can be obtained for related classes of architectures since the reconflguration problem for these classes is NP-complete. Finally, a general approximation algorithm is described that can be used for any architecture. Experimental results are given, suggesting that our algorithms are very effective.

show abstract

Optimal reconfiguration algorithms for real-time fault-tolerant processor arrays

Libeskind-Hadas

Shrivastava²,

Melhem³

et al. 1995

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Efficient and optimal fault-to-spare assignments in doubly fault tolerant arrays

Cited by 1 publication

References 10 publications

Optimal reconfiguration algorithms for real-time fault-tolerant processor arrays

Optimal reconfiguration algorithms for real-time fault-tolerant processor arrays

Contact Info

Product

Resources

About