 |
|
|
Item Details
| Title:
|
DISTRIBUTED ALGORITHMS FOR MESSAGE-PASSING SYSTEMS
|
| By: |
Michel Raynal |
| Format: |
Paperback |
| List price:
|
£54.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3642437435 |
| ISBN 13: |
9783642437434 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
14 April, 2014 |
| Edition: |
Softcover reprint of the original 1st ed. 2013 |
| Pages: |
531 |
| Description: |
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. |
| Synopsis: |
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. |
| Illustrations: |
biography |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Non-returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|