The Community for Technology Leaders
Green Image
Issue No. 09 - September (2010 vol. 21)
ISSN: 1045-9219
pp: 1281-1289
Ajay D. Kshemkalyani , University of Illinois at Chicago, Chicago
ABSTRACT
Large-scale distributed systems such as supercomputers and peer-to-peer systems typically have a fully connected logical topology over a large number of processors. Existing snapshot algorithms in such systems have high response time and/or require a large number of messages, typically O(n^2), where n is the number of processes. In this paper, we present a suite of two algorithms: simple_tree, and hypercube, that are both fast and require a small number of messages. This makes the algorithms highly scalable. Simple_tree requires O(n) messages and has O(\log n) response time. Hypercube requires O(n \log n) messages and has O(\log n) response time, in addition to having the property that the roles of all the processes are symmetrical. Process symmetry implies greater potential for balanced workload and congestion-freedom. All the algorithms assume non-FIFO channels.
INDEX TERMS
Distributed system, global state, message passing, distributed snapshot, checkpoint, hypercube, supercomputer, cluster, overlay.
CITATION
Ajay D. Kshemkalyani, "Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems", IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 1281-1289, September 2010, doi:10.1109/TPDS.2010.24
93 ms
(Ver )