The Distributed Snapshot of K.M. Chandy and L. Lamport

Autor:	Edsger W. Dijkstra
Rok vydání:	1986
Předmět:	Combinatorics Vertex (graph theory) Strongly connected component Computer Science::Discrete Mathematics TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Snapshot (computer storage) Directed graph Snapshot algorithm MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Control Flow and Data Flow: Concepts of Distributed Programming ISBN: 9783540170822
DOI:	10.1007/978-3-642-82921-5_14
Popis:	We consider a distributed system of the form of a strongly connected, finite, directed graph, of which each vertex is a machine and each edge a uni-directional first-in-first-out buffer of sufficient capacity. (Strongly connected means that there is a directed path from any vertex to any vertex.)
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::84a64a77d5b9734ee77d9bb28e4785d5 https://doi.org/10.1007/978-3-642-82921-5_14 Zobrazit plný text záznamu