Articles liés à Distributed Algorithms for Message-passing Systems
Synopsis
This book presents core concepts and algorithms of distributed computing, covering distributed graph algorithms; logical time and global states; mutual exclusion and resource allocation; high-level communication abstractions;distributed shared memory and more.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Prof. Michel Raynal is among the top researchers in the world on the topic of distributed algorithms. He is a full professor at the Université de Rennes where he founded the Distributed Algorithms research group in 1984. He has been the principal investigator in numerous related research national and international projects, and he has been invited by more than 25 universities around the world to give lectures on distributed algorithms and distributed computing. He has over 300 academic publications on this topic, and has authored a number of books on related topics. His current research interests include distributed algorithms, distributed computing systems, distributed computability and dependability; and the fundamental principles that underlie the design and the construction of distributed computing systems.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer-Verlag Berlin and Heidelberg GmbH & Co. K
- Date d'édition2013
- ISBN 10 3642381227
- ISBN 13 9783642381225
- ReliureRelié
- Langueanglais
- Nombre de pages500
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 81,44
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Distributed Algorithms for Message-passing Systems
Image d'archives
Distributed Algorithms for Message-Passing Systems
Edité par
Springer, 2013
ISBN 10 : 3642381227
ISBN 13 : 9783642381225
Ancien ou d'occasion
Couverture rigide
Vendeur : SecondSale, Montgomery, IL, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. N° de réf. du vendeur 00060537865
Quantité disponible : 1 disponible(s)
Image d'archives
Distributed Algorithms for Message-Passing Systems
Edité par
Springer, 2013
ISBN 10 : 3642381227
ISBN 13 : 9783642381225
Ancien ou d'occasion
Couverture rigide
Vendeur : SecondSale, Montgomery, IL, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. N° de réf. du vendeur 00072676813
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Distributed Algorithms for Message-Passing Systems
Edité par
Springer Berlin Heidelberg, 2013
ISBN 10 : 3642381227
ISBN 13 : 9783642381225
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Constitutes an introduction to distributed computingAuthor among the leading researchers in the area of distributed computingTextbook features include summaries, keywords, bibliographic notes and exercises for each chapterConstit. N° de réf. du vendeur 5058864
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Distributed Algorithms for Message-Passing Systems
Edité par
Springer Berlin Heidelberg, 2013
ISBN 10 : 3642381227
ISBN 13 : 9783642381225
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity. While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies. This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems. N° de réf. du vendeur 9783642381225
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Distributed Algorithms for Message-Passing Systems
Edité par
Springer Berlin Heidelberg Jul 2013, 2013
ISBN 10 : 3642381227
ISBN 13 : 9783642381225
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity. While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies. This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems. 532 pp. Englisch. N° de réf. du vendeur 9783642381225
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Distributed Algorithms for Message-Passing Systems
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2013, 2013
ISBN 10 : 3642381227
ISBN 13 : 9783642381225
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Neuware -Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity.While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies.This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 532 pp. Englisch. N° de réf. du vendeur 9783642381225
Quantité disponible : 2 disponible(s)
Image d'archives
Distributed Algorithms for Message-Passing Systems (eng)
impression à la demandeVendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 5 sur 5 étoiles
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 7ee8e28a4ef5ee88621f24b6922bcbcd
Quantité disponible : Plus de 20 disponibles
Image d'archives
Distributed Algorithms for Message-Passing Systems
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 534. N° de réf. du vendeur 2697104030
Quantité disponible : 4 disponible(s)
Image d'archives
Distributed Algorithms for Message-Passing Systems
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 534. N° de réf. du vendeur 96341825
Quantité disponible : 4 disponible(s)
Image d'archives
Distributed Algorithms for Message-Passing Systems
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 534. N° de réf. du vendeur 1897104020
Quantité disponible : 4 disponible(s)