Verwandte Artikel zu Stabilizing Graph Algorithms
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
Biografía del autor
Mehmet Hakan Karaata received his PhD degree in Computer Science in 1995 from the University of Iowa. He joined Bilkent University, Ankara, Turkey as an Assistant Professor in 1995. He is currently working as a Professor in the Department of Computer Engineering, Kuwait University. His research interests include mobile and distributed computing.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 35,90
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Stabilizing Graph Algorithms
Foto des Verkäufers
Stabilizing Graph Algorithms
Verlag:
LAP LAMBERT Academic Publishing Jul 2016, 2016
ISBN 10: 365980424X
ISBN 13: 9783659804243
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Artikel-Nr. 9783659804243
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Stabilizing Graph Algorithms
Verlag:
LAP LAMBERT Academic Publishing, 2016
ISBN 10: 365980424X
ISBN 13: 9783659804243
Neu
Paperback
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. 80 pages. 8.66x5.91x0.19 inches. In Stock. Artikel-Nr. 365980424X
Anzahl: 1 verfügbar