So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely,n processes use l different identifiers, where 1 ≤ l ≤ n. We call this model homonymous model. To determine the power of homonymous model as well as the importance of identifiers in distributed computing, this thesis studies algorithms for solving the consensus problem, one of the most famous distributed computing problem.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely,n processes use l different identifiers, where 1 ≤ l ≤ n. We call this model homonymous model. To determine the power of homonymous model as well as the importance of identifiers in distributed computing, this thesis studies algorithms for solving the consensus problem, one of the most famous distributed computing problem.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely,n processes use l different identifiers, where 1 l n. We call this model homonymous model. To determine the power of homonymous model as well as the importance of identifiers in distributed computing, this thesis studies algorithms for solving the consensus problem, one of the most famous distributed computing problem. 172 pp. Englisch. N° de réf. du vendeur 9783659425936
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Tran-The HungI have worked as a post doctoral researcher at INESC-ID, Lisbon, Portugal and received my PhD from university Paris 7, France. My main research interests are in fault-tolerant algorithms in distributed networks, dynamic . N° de réf. du vendeur 22583971
Quantité disponible : Plus de 20 disponibles
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Fault-Tolerant Consensus Algorithms with Homonyms | Hung Tran-The | Taschenbuch | 172 S. | Englisch | 2015 | LAP LAMBERT Academic Publishing | EAN 9783659425936 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. N° de réf. du vendeur 104749761
Quantité disponible : 5 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely,n processes use l different identifiers, where 1 ¿ l ¿ n. We call this model homonymous model. To determine the power of homonymous model as well as the importance of identi¿ers in distributed computing, this thesis studies algorithms for solving the consensus problem, one of the most famous distributed computing problem.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 172 pp. Englisch. N° de réf. du vendeur 9783659425936
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely,n processes use l different identifiers, where 1 l n. We call this model homonymous model. To determine the power of homonymous model as well as the importance of identifiers in distributed computing, this thesis studies algorithms for solving the consensus problem, one of the most famous distributed computing problem. N° de réf. du vendeur 9783659425936
Quantité disponible : 1 disponible(s)