Distributed Algorithms for Message-Passing Systems [Raynal 2013-06-29].pdf

(6629 KB) Pobierz
Michel Raynal
Distributed
Algorithms for
Message-Passing
Systems
Distributed Algorithms
for Message-Passing Systems
Michel Raynal
Distributed Algorithms
for Message-Passing Systems
Michel Raynal
Institut Universitaire de France
IRISA-ISTIC
Université de Rennes 1
Rennes Cedex
France
ISBN 978-3-642-38122-5
ISBN 978-3-642-38123-2 (eBook)
DOI 10.1007/978-3-642-38123-2
Springer Heidelberg New York Dordrecht London
Library of Congress Control Number: 2013942973
ACM Computing Classification (1998): F.1, D.1, B.3
© Springer-Verlag Berlin Heidelberg 2013
This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of
the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology
now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection
with reviews or scholarly analysis or material supplied specifically for the purpose of being entered
and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of
this publication or parts thereof is permitted only under the provisions of the Copyright Law of the
Publisher’s location, in its current version, and permission for use must always be obtained from Springer.
Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations
are liable to prosecution under the respective Copyright Law.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
While the advice and information in this book are believed to be true and accurate at the date of pub-
lication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any
errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect
to the material contained herein.
Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)
Preface
La profusion des choses cachait la rareté des idées et l’usure des croyances.
[. . . ]
Retenir quelque chose du temps où l’on ne sera plus.
In
Les années
(2008), Annie Ernaux
Nel mezzo del cammin di nostra vita
Mi ritrovai per una selva oscura,
Ché la diritta via era smarritta.
In
La divina commedia
(1307–1321), Dante Alighieri (1265–1321)
Wir müssen nichts sein, sondern alles werden wollen.
Johann Wolfgang von Goethe (1749–1832)
Chaque génération, sans doute, se croit vouée à refaire le monde.
La mienne sait pourtant qu’elle ne le refera pas. Mais sa tâche est peut-être plus grande.
Elle consiste à empêcher que le monde ne se défasse.
Speech at the Nobel Banquet, Stockholm, December 10, 1957, Albert Camus (1913–1960)
Rien n’est précaire comme vivre
Rien comme être n’est passager
C’est un peu fondre pour le givre
Ou pour le vent être léger
J’arrive où je suis étranger.
In
Le voyage de Hollande
(1965), Louis Aragon (1897–1982)
What Is Distributed Computing?
Distributed computing was born in the late
1970s when researchers and practitioners started taking into account the intrinsic
characteristic of physically distributed systems. The field then emerged as a special-
ized research area distinct from networking, operating systems, and parallel com-
puting.
Distributed computing
arises when one has to solve a problem in terms of dis-
tributed entities (usually called processors, nodes, processes, actors, agents, sen-
sors, peers, etc.) such that each entity has only a partial knowledge of the many
parameters involved in the problem that has to be solved. While parallel computing
and real-time computing can be characterized, respectively, by the terms
efficiency
and
on-time computing,
distributed computing can be characterized by the term
un-
certainty.
This uncertainty is created by asynchrony, multiplicity of control flows,
v

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika:

Zgłoś jeśli naruszono regulamin