Fault tolerant distributed computing (50 résultats)

paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

paperback. Etat : Very Good. Fast Shipping - Safe and Secure 7 days a week.

paperback. Etat : Very Good. Fast Shipping - Safe and Secure 7 days a week.

Paperback. Etat : Very Good. No Dust Jacket. Lecture Notes in Computer Science 448; Ex-Library. Previous owner's sticker on the front cover. Library ink stamp and light pen inscription on title page; library catalogue sticker on colophon. Faintly bumped spine head and corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.…

Etat : Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Paperback. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Paperback. Etat : Very Good. Sorry, No international shipping on this item.0387973850 Ex-library paperback in very nice condition with the usual markings and attachments.

paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Trade Paperback. Etat : Very Good. Lecture Notes in Computer Science 448. 298 pp. Light rubbing and edge wear. Interior unmarked. Spine straight and uncreased.

Etat : New. In English.

Etat : New.

Paperback. Etat : New. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New. 1st edition NO-PA16APR2015-KAP.

Etat : New. In English.

Etat : New. In English.

Etat : New. pp. 316.

Etat : New. 1st edition NO-PA16APR2015-KAP.

Etat : New. In English.

Etat : New. 1st edition NO-PA16APR2015-KAP.

Kartoniert / Broschiert. Etat : New. The goal of the Asilomar Workshop on Fault-Tolerant Distributed Computing, held March 17-19, 1986, was to facilitate interaction between theoreticians and practitioners by inviting speakers and choosing topics so as to present a broad overview of the field.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New. In English.

Etat : New.

Paperback. Etat : New. 2010th. Despite means of fault prevention such as extensive testing or formal veri?cation, errors inevitably occur during system operation. To avoid subsequent system fa- ures, critical distributed systems, therefore, require engineering of means for fault tolerance. Achieving fault tolerance requires some redundancy, which, unfor- nately, is bound to limitations. Appropriate fault models are needed to describe which types of faults and how many faults are tolerable in a certain context. Pre- ous research on distributed systems has often introduced fault models that abstract too many relevant system properties such as dependent and propagating com- nent failures. In this research work, Timo Warns introduces new structural failure models that are both accurate (to cover relevant properties) and tractable (to be - alyzable). These new failure models cover dependent failures (for instance, failure correlation by geographic proximity) and propagating failures (for instance, pr- agation by service utilization). To evaluate the new failure models, Timo Warns shows how some seminal problems in distributed systems can be solved with - proved resilience and ef?ciency, as compared to existing solutions. Particularly, the textbook-style introduction to distributed systems and the r- orous presentation of the new failure models and their evaluation may serve as an example for other software engineering research projects - which is why this book is a valuable addition to both a researcher's and a student's library.…

Etat : As New. Unread book in perfect condition.

Soft cover. Etat : New. 8vo (23.5 cm), XXI, 129 pp. Laminated wrappers. Synopsis: As the structure of contemporary communication networks grows more complex, practical networked distributed systems become prone to component failures. Fault-tolerant consensus in message-passing systems allows participants in the system to agree on a common value despite the malfunction or misbehavior of some components. It is a task of fundamental importance for distributed computing, due to its numerous applications. We summarize studies on the topological conditions that determine the feasibility of consensus, mainly focusing on directed networks and the case of restricted topology knowledge at each participant. Recently, significant efforts have been devoted to fully characterize the underlying communication networks in which variations of fault-tolerant consensus can be achieved. Although the deduction of analogous topological conditions for undirected networks of known topology had shortly followed the introduction of the problem, their extension to the directed network case has been proven a highly non-trivial task. Moreover, global knowledge restrictions, inherent in modern large-scale networks, require more elaborate arguments concerning the locality of distributed computations. In this work, we present the techniques and ideas used to resolve these issues. Recent studies indicate a number of parameters that affect the topological conditions under which consensus can be achieved, namely, the fault model, the degree of system synchrony (synchronous vs. asynchronous), the type of agreement (exact vs. approximate), the level of topology knowledge, and the algorithm class used (general vs. iterative). We outline the feasibility and impossibility results for various combinations of the above parameters, extensively illustrating the relation between network topology and consensus.…