Fault Tolerance in Distributed Systems文档.ppt

Hierarchical Feedback Control Best approach for large process groups Subgroups organized into tree with local group typically on same LAN Each subgroup has local coordinator holding message history buffer Local coordinator communicates to coordinator of connecting groups Local coordinator holds message until receipt of delivery received from all process members for group, then it can be deleted Hierarchical schemes work well. The main difficulty is in formation of the tree as this needs to be adjusted dynamically as membership changes. (balanced tree problems) * Recovery Once failure has occurred in many cases it is important to recover critical processes to a known state in order to resume processing Problem is compounded in distributed systems Two Approaches: Backward recovery, by use of checkpointing (global snapshot of distributed system status) to record the system state but checkpointing is costly (performance degradation) Forward recovery, attempt to bring system to a new stable state from which it is possible to proceed (applied in situations where the nature if errors is known and a reset can be applied) * Backward Recovery most extensively used in distributed systems and generally safest can be incorporated into middleware layers complicated in the case of process, machine or network failure no guarantee that same fault may occur again (deterministic view – affects failure transparency properties) can not be applied to irreversible (non-idempotent) operations, e.g. ATM withdrawall * Conclusion Hardware, software and networks cannot be totally free from failures Fault tolerance is a non-functional requirement that requires a system to continue to operate, even in the presence of faults. Distributed systems can be more fault tolerant than centralized systems. Agrement in faulty systems and reliable group communication are important problems in distributed systems. Replication of Data is a major fault tolerance method in distributed systems. Re