Articles liés à Cooperative Task-Oriented Computing: Algorithms and...

Cooperative Task-Oriented Computing: Algorithms and Complexity - Couverture souple

 
9783031008771: Cooperative Task-Oriented Computing: Algorithms and Complexity

Synopsis

Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings/ Bibliography / Authors' Biographies

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l?auteur

Chryssis Georgiou is an Assistant Professor in the Department of Computer Science at the University of Cyprus. He holds a Ph.D. degree (December 2003) and a M.Sc. degree (May 2002) in Computer Science & Engineering from the University of Connecticut and a B.Sc. degree (June 1998) in Mathematics from the University of Cyprus. He has worked as a Teaching and Research Assistant at the University of Connecticut, USA (1998-2003) and as a Visiting Lecturer (2004) and a Lecturer (2005-2008) at the University of Cyprus. His research interests span the theory and practice of distributed computing, in particular, design, analysis, verification and implementation of algorithms; fault-tolerance and dependability; communication protocols; cooperative distributed computing; and dynamic computing environments. Alexander Allister Shvartsman is a Professor of Computer Science & Engineering and the Director of the Center for Voting Technology Research at the University of Connecticut. He holds a Ph.D. from Brown University (1992), M.S. from Cornell University (1981), and a B.S. from Stevens Institute of Technology (1979), all in Computer Science. Prior to embarking on his academic career he worked for a number of years at Bell Labs and Digital Equipment Corporation. His professional interests are in distributed computing, fault-tolerance, and integrity of electronic voting systems. He is an author of over 130 technical articles and two books.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Acheter D'occasion

état :  Comme neuf
Unread book in perfect condition...
Afficher cet article
EUR 41,83

Autre devise

EUR 17,07 expédition depuis Etats-Unis vers France

Destinations, frais et délais

Acheter neuf

Afficher cet article
EUR 34,41

Autre devise

EUR 9,70 expédition depuis Allemagne vers France

Destinations, frais et délais

Autres éditions populaires du même titre

9781608452873: Cooperative Task-Oriented Computing: Algorithms and Complexity

Edition présentée

ISBN 10 :  1608452875 ISBN 13 :  9781608452873
Editeur : Morgan & Claypool Publishers, 2011
Couverture souple

Résultats de recherche pour Cooperative Task-Oriented Computing: Algorithms and...

Image fournie par le vendeur

Georgiou, Chryssis|Shvartsman, Alexander
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Couverture souple
impression à la demande

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, . N° de réf. du vendeur 608129185

Contacter le vendeur

Acheter neuf

EUR 34,41
Autre devise
Frais de port : EUR 9,70
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Georgiou, Chryssis; Shvartsman, Alexander
Edité par Springer, 2011
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. In English. N° de réf. du vendeur ria9783031008771_new

Contacter le vendeur

Acheter neuf

EUR 42,08
Autre devise
Frais de port : EUR 4,63
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Georgiou, Chryssis; Shvartsman, Alexander
Edité par Springer, 2011
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Couverture souple

Vendeur : California Books, Miami, FL, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur I-9783031008771

Contacter le vendeur

Acheter neuf

EUR 41,33
Autre devise
Frais de port : EUR 6,83
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Alexander Shvartsman
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings/ Bibliography / Authors' Biographies. N° de réf. du vendeur 9783031008771

Contacter le vendeur

Acheter neuf

EUR 37,44
Autre devise
Frais de port : EUR 10,99
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Alexander Shvartsman
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Taschenbuch
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings / Bibliography / Authors' Biographies 168 pp. Englisch. N° de réf. du vendeur 9783031008771

Contacter le vendeur

Acheter neuf

EUR 37,44
Autre devise
Frais de port : EUR 11
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Georgiou, Chryssis
Edité par Springer 2011-08, 2011
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf PF

Vendeur : Chiron Media, Wallingford, Royaume-Uni

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783031008771

Contacter le vendeur

Acheter neuf

EUR 38,30
Autre devise
Frais de port : EUR 11,01
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 10 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Alexander Shvartsman
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Neuware -Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings/ Bibliography / Authors' BiographiesSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 168 pp. Englisch. N° de réf. du vendeur 9783031008771

Contacter le vendeur

Acheter neuf

EUR 37,44
Autre devise
Frais de port : EUR 15
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Georgiou, Chryssis; Shvartsman, Alexander
Edité par Springer, 2011
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Couverture souple

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 44571028-n

Contacter le vendeur

Acheter neuf

EUR 37,74
Autre devise
Frais de port : EUR 17,07
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Georgiou, Chryssis; Shvartsman, Alexander
Edité par Springer, 2011
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Neuf Couverture souple

Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 44571028-n

Contacter le vendeur

Acheter neuf

EUR 41,27
Autre devise
Frais de port : EUR 17,40
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Georgiou, Chryssis; Shvartsman, Alexander
Edité par Springer, 2011
ISBN 10 : 3031008774 ISBN 13 : 9783031008771
Ancien ou d'occasion Couverture souple

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 44571028

Contacter le vendeur

Acheter D'occasion

EUR 41,83
Autre devise
Frais de port : EUR 17,07
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

There are 2 autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre