V. P. Nelson, Fault-tolerant computing: fundamental concepts, Computer, vol.23, issue.7, pp.19-25, 1990.
DOI : 10.1109/2.56849

W. Cirne, F. Brasileiro, D. Paranhos, L. F. Góes, and W. Voorsluys, On the efficacy, efficiency and emergent behavior of task replication in large distributed systems, Parallel Computing, vol.33, issue.3, pp.213-234, 2007.
DOI : 10.1016/j.parco.2007.01.002

B. Parhami, Voting algorithms, IEEE Transactions on Reliability, vol.43, issue.4, pp.617-629, 1994.
DOI : 10.1109/24.370218

R. West and C. Poellabauer, Analysis of a window-constrained scheduler for real-time and best-effort packet streams, Proceedings 21st IEEE Real-Time Systems Symposium, pp.239-248, 2000.
DOI : 10.1109/REAL.2000.896013

R. West, Y. Zhang, K. Schwan, and C. Poellabauer, Dynamic windowconstrained scheduling of real-time streams in media servers, 2004.

R. West and K. Schwan, Dynamic window-constrained scheduling for multimedia applications, Proceedings IEEE International Conference on Multimedia Computing and Systems, pp.87-91, 1999.
DOI : 10.1109/MMCS.1999.778145
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.6318

P. Jalote, Fault Tolerance in Distributed Systems, 1994.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

H. W. Kuhn, The hungarian method for the assignment problem, pp.83-97, 1955.

M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979.

A. Benoit, A. Dobrila, J. Nicod, L. Philippe, and . Lyon, Throughput Optimization for Micro-factories Subject to Failures, 2009 Eighth International Symposium on Parallel and Distributed Computing, 2009.
DOI : 10.1109/ISPDC.2009.26
URL : https://hal.archives-ouvertes.fr/hal-00563300