Cost modeling of N-version fault-tolerant software systems for large N

1996 ◽  
Vol 45 (2) ◽  
pp. 297-302 ◽  
Author(s):  
R.K. Scott ◽  
D.F. McAllister
1994 ◽  
Vol 25 (1) ◽  
pp. 23-37 ◽  
Author(s):  
Angelo Perkusich ◽  
J.C.A de Figueiredo ◽  
S.K Chang

IEEE Micro ◽  
1998 ◽  
Vol 18 (5) ◽  
pp. 22-32 ◽  
Author(s):  
V. Strumpen

2008 ◽  
pp. 650-665
Author(s):  
Armando Walter Colombo ◽  
Ronald Schoop

This chapter summarizes our latest results concerning the development and the industrial application of the emerging “collaborative industrial automation” technology and its powerful meaning for facilitating the integration of a dynamic reconfigurable shop floor into a virtual factory. It argues, in this respect, that having a conglomerate of distributed, autonomous, intelligent, fault-tolerant, and reconfigurable production units, which operate as a set of cooperating entities, is one promising platform to achieve both local and global manufacturing objectives. Furthermore, the authors hope that understanding the underlying scientific and technological background through the development and industrial application of the collaborative automation paradigm will not only inform the academic, research, and industrial world of an emerging control and automation paradigm, but also assist in the understanding of a new vision of the manufacturing system of the 21st century [a mix of collaborative units, i.e., people, software systems, processes, and equipment (hardware), integrated into a virtual factory].


Author(s):  
Andreas Bolfing

Chapter 5 considers distributed systems by their properties. The first section studies the classification of software systems, which is usually distinguished in centralized, decentralized and distributed systems. It studies the differences between these three major approaches, showing there is a rather multidimensional classification instead of a linear one. The most important case are distributed systems that enable spreading of computational tasks across several autonomous, independently acting computational entities. A very important result of this case is the CAP theorem that considers the trade-off between consistency, availability and partition tolerance. The last section deals with the possibility to reach consensus in distributed systems, discussing how fault tolerant consensus mechanisms enable mutual agreement among the individual entities in presence of failures. One very special case are so-called Byzantine failures that are discussed in great detail. The main result is the so-called FLP Impossibility Result which states that there is no deterministic algorithm that guarantees solution to the consensus problem in the asynchronous case. The chapter concludes by considering practical solutions that circumvent the impossibility result in order to reach consensus.


1990 ◽  
Vol 39 (5) ◽  
pp. 524-534 ◽  
Author(s):  
D.F. McAllister ◽  
C.-E. Sun ◽  
M.A. Vouk

2003 ◽  
Vol 28 (5) ◽  
pp. 375-378 ◽  
Author(s):  
Paulo Asterio de C. Guerra ◽  
Cecília Mary F. Rubira ◽  
Alexander Romanovsky ◽  
Rogério de Lemos

Sign in / Sign up

Export Citation Format

Share Document