×

Mobile agent based checkpointing with concurrent initiations. (English) Zbl 1202.68069

Summary: Traditional message passing based checkpointing and rollback recovery algorithms perform well for tightly coupled systems. In wide area distributed systems these algorithms may suffer from large overhead due to message passing delay and network traffic. Mobile agents offer an attractive option for designing checkpointing schemes for wide area distributed systems. Network topology is assumed to be arbitrary. Processes are mobile agent enabled. When a process wants to take a checkpoint, it just creates one mobile agent. Concurrent initiations by multiple processes are allowed. Synchronization and creation of a consistent global state (CGS) for checkpointing is managed by the mobile agent(s). In the worst case, for k concurrent initiations among n processes, checkpointing algorithm requires a total of \(O(kn)\) hops by all the mobile agents. A mobile agent carries \(O(n/k)\) (on the average) size data.

MSC:

68M14 Distributed systems
68M15 Reliability, testing and fault tolerance of networks and computer systems
Full Text: DOI

References:

[1] DOI: 10.1007/s446-002-8026-7 · doi:10.1007/s446-002-8026-7
[2] DOI: 10.1145/214451.214456 · doi:10.1145/214451.214456
[3] Cao G., IEEE Trans. Parallel and Distributed Syst. 9 pp 1213–
[4] DOI: 10.1145/568522.568525 · doi:10.1145/568522.568525
[5] Hlary J. M., Distributed Computing 13 pp 29–
[6] Johnson D., J. of Algorithms 3 pp 462–
[7] Kin J. L., IEEE Trans. Parallel and Distributed Syst. 5 pp 955–
[8] Koo R., IEEE Trans. Software Eng. 13 pp 23–
[9] DOI: 10.1016/j.jpdc.2004.03.013 · Zbl 1073.68528 · doi:10.1016/j.jpdc.2004.03.013
[10] DOI: 10.1109/71.780865 · doi:10.1109/71.780865
[11] DOI: 10.1109/TSMCC.2003.818496 · doi:10.1109/TSMCC.2003.818496
[12] DOI: 10.1109/71.539735 · doi:10.1109/71.539735
[13] DOI: 10.1145/3959.3962 · doi:10.1145/3959.3962
[14] DOI: 10.1109/71.780864 · doi:10.1109/71.780864
[15] DOI: 10.1109/12.588059 · doi:10.1109/12.588059
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.