Distributed Algorithms for Message-Passing Systems

Nonfiction, Computers, Networking & Communications, Hardware, Advanced Computing, Computer Science, General Computing
Cover of the book Distributed Algorithms for Message-Passing Systems by Michel Raynal, Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Michel Raynal ISBN: 9783642381232
Publisher: Springer Berlin Heidelberg Publication: June 29, 2013
Imprint: Springer Language: English
Author: Michel Raynal
ISBN: 9783642381232
Publisher: Springer Berlin Heidelberg
Publication: June 29, 2013
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer Berlin Heidelberg

Cover of the book Aging Hair by Michel Raynal
Cover of the book Extending the Boundaries of Research on Second Language Learning and Teaching by Michel Raynal
Cover of the book The Thrust Plate Hip Prosthesis by Michel Raynal
Cover of the book Übersetzerbau by Michel Raynal
Cover of the book Rohrleitungen 1 by Michel Raynal
Cover of the book Acute Leukemias by Michel Raynal
Cover of the book The Diabetic Patient Agent by Michel Raynal
Cover of the book The Narrow Lumbar Canal by Michel Raynal
Cover of the book Erneuerbare Energien by Michel Raynal
Cover of the book Setting Up Representative Offices in China by Michel Raynal
Cover of the book Brain Abscess and Meningitis by Michel Raynal
Cover of the book Host-Pathogen Interactions in Streptococcal Diseases by Michel Raynal
Cover of the book Liebe lässt sich lernen by Michel Raynal
Cover of the book Fundamental Astronomy by Michel Raynal
Cover of the book Solitude of a Humble Genius - Gregor Johann Mendel: Volume 1 by Michel Raynal
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy