Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems

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 ), wher...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 21; no. 9; pp. 1281 - 1289
Main Author:	Kshemkalyani, Ajay D
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.09.2010 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Balancing Channels checkpoint Checkpointing cluster Clustering algorithms Computer networks Delay distributed snapshot Distributed system global state hypercube Hypercubes Joining processes Large-scale systems Message passing Messages overlay Peer to peer computing Response time supercomputer Supercomputers Topology Workload
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!