A symmetric O(n log n) message distributed snapshot algorithm for large-scale systems

This paper presents a O(n log n) message distributed snapshot algorithm for a system with non-FIFO channels, where n is the number of processors. The algorithm finds applications for checkpointing in large scale supercomputers and distributed systems that have a fully connected logical topology over...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 IEEE International Conference on Cluster Computing and Workshops s. 1 - 4
Hlavní autor: Kshemkalyani, A.D.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2009
Témata:
Application software
Checkpointing
Computer science
Costs
Delay
Hypercubes
Large-scale systems
Supercomputers
Topology
Tree graphs
ISBN:9781424450114, 142445011X
ISSN:1552-5244
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents a O(n log n) message distributed snapshot algorithm for a system with non-FIFO channels, where n is the number of processors. The algorithm finds applications for checkpointing in large scale supercomputers and distributed systems that have a fully connected logical topology over a large number of processors. Each processor sends log n messages in the algorithm. The sizes of the messages are geometrically distributed, and the sum of the sizes of the messages sent by any processor is n. The response time of the algorithm is O(log n). The algorithm is fully distributed and the role of each processor is symmetric, unlike tree-based, ring-based, and centralized algorithms.
ISBN:9781424450114
142445011X
ISSN:1552-5244
DOI:10.1109/CLUSTR.2009.5289139