×

Heuristic assignments of redundant software versions and processors in fault-tolerant computer systems for maximum reliability. (English) Zbl 1134.90368

Summary: We address the problem of assigning multiple copies of \(n\) independently developed versions of a program to a set of \(m\) \((m\gg n)\) possibly heterogeneous processors to maximize system reliability. This problem is viewed as a partition and assignment problem.

MSC:

90B25 Reliability, availability, maintenance, inspection in operations research
62N05 Reliability and life testing
68Q99 Theory of computing
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Chen, Eighth Annual Intl. Conference of Fault-Tolerant Computing pp 3– (1978)
[2] DOI: 10.1109/PROC.1978.11115 · doi:10.1109/PROC.1978.11115
[3] Randell, IEEE Trans. on Software Eng. l pp 220– (1975) · doi:10.1109/TSE.1975.6312842
[4] Nijenhuis, Combinatorial algorithms for computers and calculators (1978)
[5] DOI: 10.1109/TC.1980.1675512 · doi:10.1109/TC.1980.1675512
[6] Liu, Introduction to combinatorial mathematics (1968) · Zbl 0188.03801
[7] DOI: 10.1145/356678.356681 · doi:10.1145/356678.356681
[8] DOI: 10.1109/PROC.1978.11106 · doi:10.1109/PROC.1978.11106
[9] Denardo, Dynamic programming models and applications (1982) · Zbl 0154.45101
[10] DOI: 10.1109/TC.1982.1675884 · doi:10.1109/TC.1982.1675884
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.