Artículos relacionados a Stabilizing Graph Algorithms
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 35,90
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Stabilizing Graph Algorithms
Imagen del vendedor
Stabilizing Graph Algorithms
Publicado por
LAP LAMBERT Academic Publishing Jul 2016, 2016
ISBN 10: 365980424X
ISBN 13: 9783659804243
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783659804243
Cantidad disponible: 2 disponibles
Imagen del vendedor
Stabilizing Graph Algorithms
Publicado por
LAP LAMBERT Academic Publishing, 2016
ISBN 10: 365980424X
ISBN 13: 9783659804243
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783659804243
Cantidad disponible: 1 disponibles
Imagen del vendedor
Stabilizing Graph Algorithms
Publicado por
LAP LAMBERT Academic Publishing Jul 2016, 2016
ISBN 10: 365980424X
ISBN 13: 9783659804243
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783659804243
Cantidad disponible: 2 disponibles
Imagen de archivo
Stabilizing Graph Algorithms
Publicado por
LAP LAMBERT Academic Publishing, 2016
ISBN 10: 365980424X
ISBN 13: 9783659804243
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 80 pages. 8.66x5.91x0.19 inches. In Stock. Nº de ref. del artículo: 365980424X
Cantidad disponible: 1 disponibles