EUR 30,34
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 32,68
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
EUR 31,98
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 31,25
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
EUR 33,55
Cantidad disponible: 1 disponibles
Añadir al carritoSoft Cover. Condición: Good. Ex-library with the usual features. Library label on front cover. The interior is clean and tight. Binding is good. Cover shows very light wear. Ex-Library.
Publicado por Springer International Publishing AG, CH, 2011
ISBN 10: 3031008782 ISBN 13: 9783031008788
Idioma: Inglés
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 39,57
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. 1°. 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.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 32,39
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In English.
EUR 31,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 47,04
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
EUR 35,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 34,90
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
EUR 28,46
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: NEW.
Publicado por Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2011
ISBN 10: 3031008782 ISBN 13: 9783031008788
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 37,61
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. 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.
Publicado por Springer International Publishing AG, CH, 2011
ISBN 10: 3031008782 ISBN 13: 9783031008788
Idioma: Inglés
Librería: Rarewaves.com UK, London, Reino Unido
EUR 36,76
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. 1°. 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.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 35,98
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 102 pages. 9.25x7.51x9.25 inches. In Stock. This item is printed on demand.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 47,98
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 49,39
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.