IEICE TRANSACTIONS on transactions
Spare Processor Assignment for Reconfiguration of Fault-Tolerant Arrays
Summary :
To provide the processor arrays with adequate fault-tolerant capabilities, a number of spare or redundant processors are prepared within the arrays. For such processor arrays, reconfiguration should be executed to bypass faulty processors. Concerning reconfiguration of processor arrays, Melhem presented a minimization problem (called the SPA problem). The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, the dangerous processors are processors, for which there remains no longer any spare processor to be assigned when one more faults occur. In this paper, we present a more rigorous definition of the SPA problem, in which input parameters are n2 ordinary processors, 2n spare processors and m (m
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.8 pp.1247-1256
- Publication Date
- 1990/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Fault-Tolerant Systems)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Chang CHEN, An FENG, Yoshihiro TAKADA, Tohru KIKUNO, Koji TORII, "Spare Processor Assignment for Reconfiguration of Fault-Tolerant Arrays" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 8, pp. 1247-1256, August 1990, doi: .
Abstract: To provide the processor arrays with adequate fault-tolerant capabilities, a number of spare or redundant processors are prepared within the arrays. For such processor arrays, reconfiguration should be executed to bypass faulty processors. Concerning reconfiguration of processor arrays, Melhem presented a minimization problem (called the SPA problem). The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, the dangerous processors are processors, for which there remains no longer any spare processor to be assigned when one more faults occur. In this paper, we present a more rigorous definition of the SPA problem, in which input parameters are n2 ordinary processors, 2n spare processors and m (m
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_8_1247/_p
Copy
@ARTICLE{e73-e_8_1247,
author={Chang CHEN, An FENG, Yoshihiro TAKADA, Tohru KIKUNO, Koji TORII, },
journal={IEICE TRANSACTIONS on transactions},
title={Spare Processor Assignment for Reconfiguration of Fault-Tolerant Arrays},
year={1990},
volume={E73-E},
number={8},
pages={1247-1256},
abstract={To provide the processor arrays with adequate fault-tolerant capabilities, a number of spare or redundant processors are prepared within the arrays. For such processor arrays, reconfiguration should be executed to bypass faulty processors. Concerning reconfiguration of processor arrays, Melhem presented a minimization problem (called the SPA problem). The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, the dangerous processors are processors, for which there remains no longer any spare processor to be assigned when one more faults occur. In this paper, we present a more rigorous definition of the SPA problem, in which input parameters are n2 ordinary processors, 2n spare processors and m (m
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Spare Processor Assignment for Reconfiguration of Fault-Tolerant Arrays
T2 - IEICE TRANSACTIONS on transactions
SP - 1247
EP - 1256
AU - Chang CHEN
AU - An FENG
AU - Yoshihiro TAKADA
AU - Tohru KIKUNO
AU - Koji TORII
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 8
JA - IEICE TRANSACTIONS on transactions
Y1 - August 1990
AB - To provide the processor arrays with adequate fault-tolerant capabilities, a number of spare or redundant processors are prepared within the arrays. For such processor arrays, reconfiguration should be executed to bypass faulty processors. Concerning reconfiguration of processor arrays, Melhem presented a minimization problem (called the SPA problem). The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, the dangerous processors are processors, for which there remains no longer any spare processor to be assigned when one more faults occur. In this paper, we present a more rigorous definition of the SPA problem, in which input parameters are n2 ordinary processors, 2n spare processors and m (m
ER -
English
