Format:
1 Online-Ressource (viii, 93 Seiten)
Edition:
Electronic reproduction Available via World Wide Web
ISBN:
9781608450428
Series Statement:
Synthesis lectures on distributed computing theory #8
Content:
Includes bibliographical references
Content:
1. Introduction --
Content:
2. Routing in a graph: correctness -- 2.1 Abstract link reversal -- 2.2 Vertex labels -- 2.3 Link labels --
Content:
3. Routing in a graph: complexity -- 3.1 Work complexity -- 3.1.1 Vertex labeling -- 3.1.2 Link labeling -- 3.1.3 FR vs. PR with game theory -- 3.2 Time complexity -- 3.2.1 Full reversal -- 3.2.2 General LR and partial reversal --
Content:
4. Routing and leader election in a distributed system -- 4.1 Distributed system model for applications -- 4.2 Routing in dynamic graphs -- 4.2.1 Overview of TORA -- 4.2.2 Route creation -- 4.2.3 Route maintenance -- 4.2.4 Erasing routes -- 4.2.5 Discussion -- 4.3 Leader election in dynamic graphs --
Content:
5. Mutual exclusion in a distributed system -- 5.1 Mutual exclusion in fixed topologies -- 5.1.1 LRME algorithm -- 5.1.2 Correctness of LRME algorithm -- 5.2 Mutual exclusion for dynamic topologies --
Content:
6. Distributed queueing -- 6.1 The arrow protocol -- 6.2 Correctness of arrow -- 6.3 Discussion --
Content:
7. Scheduling in a graph -- 7.1 Preliminaries -- 7.2 Analysis for trees -- 7.3 Analysis for non-trees -- 7.4 Discussion --
Content:
8. Resource allocation in a distributed system -- 8.1 Chandy and Misra's algorithm -- 8.2 Correctness of Chandy and Misra's algorithm --
Content:
9. Conclusion -- Bibliography -- Authors' biographies
Note:
Description based upon print version of record
,
Acknowledgments; Introduction; Routing in a Graph: Correctness; Abstract Link Reversal; Vertex Labels; Link Labels; Routing in a Graph: Complexity; Work Complexity; Vertex Labeling; Link Labeling; FR vs. PR with Game Theory; Time Complexity; Full Reversal; General LR and Partial Reversal; Routing and Leader Election in a Distributed System; Distributed System Model for Applications; Routing in Dynamic Graphs; Overview of TORA; Route Creation; Route Maintenance; Erasing Routes; Discussion; Leader Election in Dynamic Graphs; Mutual Exclusion in a Distributed System
,
Mutual Exclusion in Fixed TopologiesLRME Algorithm; Correctness of LRME Algorithm; Mutual Exclusion for Dynamic Topologies; Distributed Queueing; The Arrow Protocol; Correctness of Arrow; Discussion; Scheduling in a Graph; Preliminaries; Analysis for Trees; Analysis for Non-Trees; Discussion; Resource Allocation in a Distributed System; Chandy and Misra's Algorithm; Correctness of Chandy and Misra's Algorithm; Conclusion; Bibliography; Authors' Biographies;
,
Electronic reproduction Available via World Wide Web
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Additional Edition:
ISBN 9781608450411
Additional Edition:
Erscheint auch als Druck-Ausgabe Link Reversal Algorithms
Language:
English
Keywords:
Electronic books
DOI:
10.2200/S00389ED1V01Y201111DCT008
Bookmarklink
