Items related to Link Reversal Algorithms (Synthesis Lectures on Distributed...
- PublisherSpringer
- Publication date2011
- ISBN 10 3031008782
- ISBN 13 9783031008788
- BindingPaperback
- Edition number1
- Number of pages102
Top Search Results from the AbeBooks Marketplace
Seller Image
Link Reversal Algorithms (Synthesis Lectures on Distributed Computing Theory) by Welch, Jennifer, Walter, Jennifer [Paperback ]
Seller:
Rating
Book Description Soft Cover. Condition: new. Seller Inventory # 9783031008788
Buy New
£ 31.76
Convert currency
Stock Image
Link Reversal Algorithms
Published by
Springer
(2011)
ISBN 10: 3031008782
ISBN 13: 9783031008788
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783031008788_lsuk
Buy New
£ 30.66
Convert currency
Seller Image
Link Reversal Algorithms
Seller:
Rating
Book Description Condition: New. Seller Inventory # 44571029-n
Buy New
£ 40.56
Convert currency
Stock Image
Link Reversal Algorithms
Seller:
Rating
Book Description PF. Condition: New. Seller Inventory # 6666-IUK-9783031008788
Buy New
£ 27.84
Convert currency
Seller Image
Link Reversal Algorithms
Published by
Springer International Publishing Nov 2011
(2011)
ISBN 10: 3031008782
ISBN 13: 9783031008788
New
Taschenbuch
Quantity: 2
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yet to be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion 104 pp. Englisch. Seller Inventory # 9783031008788
Buy New
£ 30.92
Convert currency
Seller Image
Link Reversal Algorithms
Seller:
Rating
Book Description Condition: New. Seller Inventory # 44571029-n
Buy New
£ 37.27
Convert currency
Stock Image
Link Reversal Algorithms
Seller:
Rating
Book Description Condition: New. 2011. Paperback. . . . . . Seller Inventory # V9783031008788
Buy New
£ 45.18
Convert currency
Seller Image
Link Reversal Algorithms
Published by
Springer International Publishing
(2011)
ISBN 10: 3031008782
ISBN 13: 9783031008788
New
Taschenbuch
Quantity: 1
Seller:
Rating
Book Description Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yetto be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion. Seller Inventory # 9783031008788
Buy New
£ 33.68
Convert currency
Stock Image
Link Reversal Algorithms
Seller:
Rating
Book Description Condition: New. 2011. Paperback. . . . . . Books ship from the US and Ireland. Seller Inventory # V9783031008788
Buy New
£ 53.75
Convert currency
Seller Image
Link Reversal Algorithms
Published by
Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer
(2011)
ISBN 10: 3031008782
ISBN 13: 9783031008788
New
Softcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing th. Seller Inventory # 608129186
Buy New
£ 28.63
Convert currency