The running times of large-scale computational science and engineering parallel applications, executed on clusters or Grid platforms, are usually longer than the mean-time-between-failures (MTBF). Therefore, hardware failures must be tolerated to ensure that not all computation done is lost on machine failures. Checkpointing and rollback recovery are very useful techniques to implement fault-to...

The problem of reliability of new object of distributed hardware software (DHS) multi-agent system (MAS) is considered. DHS MAS is determined as a system that is based on agent technologies and consists of both agents and hardware components required for execution of agents and for interaction of agents with an environment. Reliability improvement, fault-recovery and several reliability assessm...

System architectures based on a cluster of computers have gained substantial attention recently. In a clustered system, complex software-intensive applications can be built with commercial hardware, operating systems, and application software to achieve high system availability and data integrity, while performance and cost penalties are greatly reduced by the use of separate error detection ha...

Checkpointing and Rollback Recovery Algorithms for Fault Tolerance in MANETs: A Review Sushant Patial Department of Computer Science, Himachal Pradesh University Shimla-5 Email: patialsushant @gmail.com Jawahar Thakur Department of Computer Science, Himachal Pradesh University Shimla-5 Email: jawahar.hpu @gmail.com -------------------------------------------------------------------ABSTRACT-----...

The escalating increase in the complexity of multiprocessor systems increases the probability of faults occurring in these systems As a consequence there is a great need for achieving fault-tolerance of processing in multiprocessor systems. Faulttolerance generally requires some forms of hardware and/or time redundancy. Two fault tolerant configurations are proposed for both single and double t...

The fundamental goal of the log-based fault-tolerant scheme is to bring the system into a consistent global state without any orphan inconsistence. However, the existing Alvisi’s No-Orphans Consistency Condition is only sufficient on condition that the set of local checkpoints of failure processes keep consistent always. Independent of the specific log-based checkpointing and rollback-recovery ...

We present new combined attacks on the AES key schedule based on the work of Roche et al. [16]. The main drawbacks of the original attack are: the need for high repeatability of the fault, a very particular fault model and a very high complexity of the key recovery algorithm. We consider more practical fault models, we obtain improved key recovery algorithms and we present more attack paths for...

Peer-to-peer (P2P)–Grid systems are being investigated as a platform for converging the Grid and P2P network in the construction of large-scale distributed applications. The highly dynamic nature of P2P–Grid systems greatly affects the execution of the distributed program. Uncertainty caused by arbitrary node failure and departure significantly affects the availability of computing resources an...

Fault tolerance is a crucial design consideration for missioncritical distributed real-time and embedded (DRE) systems, such as avionics mission computing systems, and supervisory control and data acquisition systems. Increasingly more of these systems are created using emerging middleware standards, such as publish-subscribe communication services and component based architectures. Most previo...

The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this paper, we address the problem of synthesizing two types of 2-phase recovery: relaxed and graceful. Intuitively, relaxed 2-phase recovery requires that in the presence of faults, the program recovers to an acceptable be...