A GENERAL DISTRIBUTED GRAPH ALGORITHM FOR FAIR ACCESS TO CRITICAL SECTIONS

We deal with the following problems: Given an arbitrary undirected graph where each node is understood to represent a sequential process. Each such process has just onecritical section, and two neighbors cannot use their critical sections but mutually exclusively. Direct communication between neighb...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Distributed Algorithms on Graphs s. 153 - 159
Hlavní autoři: Santoro, Nicola, Gafni, Eli
Médium: Kapitola
Jazyk:angličtina
Vydáno: Canada MQUP 1986
McGill-Queen's University Press
Témata:
Acknowledgments
Algorithms
Applied sciences
Behavioral sciences
Board games
Communications
Communicative content
Computer engineering
Computer science
Computer software
Games
Human geography
Leisure studies
Neighborhoods
Operating systems
Recreation
Social geography
Social sciences
ISBN:9780886290542, 0886290546
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í:We deal with the following problems: Given an arbitrary undirected graph where each node is understood to represent a sequential process. Each such process has just onecritical section, and two neighbors cannot use their critical sections but mutually exclusively. Direct communication between neighbors may occur in both directions, even simultaneously. There is no way to establish any kind of centralized control. No assumption on relative speeds, on fixed priorities, on shared memory etc. is allowed. An algorithm has then to be designed which does not deadlock and which is fair in the sense that any node process when interested
ISBN:9780886290542
0886290546
DOI:10.1515/9780773573475-012