Distributed Algorithms for Message-Passing Systems (Paperback, Softcover reprint of the original 1st ed. 2013)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Release date:	July 2015
First published:	2013
Authors:	Michel Raynal
Dimensions:	235 x 155 x 27mm (L x W x T)
Format:	Paperback
Pages:	500
Edition:	Softcover reprint of the original 1st ed. 2013
ISBN-13:	978-3-642-43743-4
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Computer hardware & operating systems > General Books > Computing & IT > Computer programming > General Books > Computing & IT > Internet > Network computers Books > Computing & IT > Applications of computing > General
LSN:	3-642-43743-5
Barcode:	9783642437434

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!