Articles liés à Stabilizing Graph Algorithms
Synopsis
A distributed system consists of a set of loosely connected processes that do not share a global memory. The task of many open distributed systems is to guarantee an invariance relationship over the states of the system, and the states of the environment influencing that system. When the invariant holds, the state of the system is legal; otherwise it is illegal. Occasionally, the actions of the environment perturbs the state of the system and puts it into an illegal state-this is viewed as a transient failure. A self-stabilizing system guarantees that, regardless of the current state, the system returns to a legal state in a bounded number of steps. Due to this property, self-stabilizing systems can beused to deal with variety of faults in distributed systems. This dissertation deals with devising self-stabilizing distributed systems for a variety of graph theoretic problems. These include graph coloring, center and median finding, and maxima finding problems. The proposed solutions tolerate dynamic changes in the topology of the network.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 35,90
EUR 10,99 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Stabilizing Graph Algorithms
Image fournie par le vendeur
Stabilizing Graph Algorithms
Edité par
LAP LAMBERT Academic Publishing, 2016
ISBN 10 : 365980424X
ISBN 13 : 9783659804243
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A distributed system consists of a set of loosely connected processes that do not share a global memory. The task of many open distributed systems is to guarantee an invariance relationship over the states of the system, and the states of the environment influencing that system. When the invariant holds, the state of the system is legal; otherwise it is illegal. Occasionally, the actions of the environment perturbs the state of the system and puts it into an illegal state-this is viewed as a transient failure. A self-stabilizing system guarantees that, regardless of the current state, the system returns to a legal state in a bounded number of steps. Due to this property, self-stabilizing systems can beused to deal with variety of faults in distributed systems. This dissertation deals with devising self-stabilizing distributed systems for a variety of graph theoretic problems. These include graph coloring, center and median finding, and maxima finding problems. The proposed solutions tolerate dynamic changes in the topology of the network. N° de réf. du vendeur 9783659804243
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Stabilizing Graph Algorithms
Edité par
LAP LAMBERT Academic Publishing Jul 2016, 2016
ISBN 10 : 365980424X
ISBN 13 : 9783659804243
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A distributed system consists of a set of loosely connected processes that do not share a global memory. The task of many open distributed systems is to guarantee an invariance relationship over the states of the system, and the states of the environment influencing that system. When the invariant holds, the state of the system is legal; otherwise it is illegal. Occasionally, the actions of the environment perturbs the state of the system and puts it into an illegal state-this is viewed as a transient failure. A self-stabilizing system guarantees that, regardless of the current state, the system returns to a legal state in a bounded number of steps. Due to this property, self-stabilizing systems can beused to deal with variety of faults in distributed systems. This dissertation deals with devising self-stabilizing distributed systems for a variety of graph theoretic problems. These include graph coloring, center and median finding, and maxima finding problems. The proposed solutions tolerate dynamic changes in the topology of the network. 80 pp. Englisch. N° de réf. du vendeur 9783659804243
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Stabilizing Graph Algorithms
Edité par
LAP LAMBERT Academic Publishing Jul 2016, 2016
ISBN 10 : 365980424X
ISBN 13 : 9783659804243
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -A distributed system consists of a set of loosely connected processes that do not share a global memory. The task of many open distributed systems is to guarantee an invariance relationship over the states of the system, and the states of the environment influencing that system. When the invariant holds, the state of the system is legal; otherwise it is illegal. Occasionally, the actions of the environment perturbs the state of the system and puts it into an illegal state-this is viewed as a transient failure. A self-stabilizing system guarantees that, regardless of the current state, the system returns to a legal state in a bounded number of steps. Due to this property, self-stabilizing systems can beused to deal with variety of faults in distributed systems. This dissertation deals with devising self-stabilizing distributed systems for a variety of graph theoretic problems. These include graph coloring, center and median finding, and maxima finding problems. The proposed solutions tolerate dynamic changes in the topology of the network.Books on Demand GmbH, Überseering 33, 22297 Hamburg 80 pp. Englisch. N° de réf. du vendeur 9783659804243
Quantité disponible : 2 disponible(s)
Image d'archives
Stabilizing Graph Algorithms
Edité par
LAP LAMBERT Academic Publishing, 2016
ISBN 10 : 365980424X
ISBN 13 : 9783659804243
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 80 pages. 8.66x5.91x0.19 inches. In Stock. N° de réf. du vendeur 365980424X
Quantité disponible : 1 disponible(s)