Search Results

ENGLISH

Recoverable Mutual Exclusion

by Neeraj Mittal, Sahil Dhoked e Wojciech Golab

~~47,30€~~ 42,57€ 10% OFF

free shipping

 This book discusses the recent research work on designing efficient fault-tolerant synchronization mechanisms for concurrent processes using the relatively new persistent memory technology that combines the low latency benefits of DRAM with the persistence of magnetic disks.
ENGLISH

Recoverable Mutual Exclusion

by Neeraj Mittal, Sahil Dhoked e Wojciech Golab

47,30€ + 10% CARD

free shipping

 This book discusses the recent research work on designing efficient fault-tolerant synchronization mechanisms for concurrent processes using the relatively new persistent memory technology that combines the low latency benefits of DRAM with the persistence of magnetic disks.
ENGLISH

Secure Multi-Party Computation Against Passive Adversaries

by Arpita Patra e Ashish Choudhury

74,34€ + 10% CARD

free shipping

 This book focuses on multi-party computation (MPC) protocols in the passive corruption model (also known as the semi-honest or honest-but-curious model). On a very high level, an MPC protocol allows a set of mutually-distrusting parties with their private inputs to jointly and securely perform any computation on their inputs.
ENGLISH

Recoverable Mutual Exclusion

by Neeraj Mittal, Sahil Dhoked e Wojciech Golab

46,36€ + 10% CARD

 This book discusses the recent research work on designing efficient fault-tolerant synchronization mechanisms for concurrent processes using the relatively new persistent memory technology that combines the low latency benefits of DRAM with the persistence of magnetic disks.
ENGLISH

Secure Multi-Party Computation Against Passive Adversaries

by Arpita Patra e Ashish Choudhury

72,86€ + 10% CARD

 This book focuses on multi-party computation (MPC) protocols in the passive corruption model (also known as the semi-honest or honest-but-curious model). On a very high level, an MPC protocol allows a set of mutually-distrusting parties with their private inputs to jointly and securely perform any computation on their inputs.
ENGLISH

Theory Of Timed I/O Automata, Second Edition

by Dilsun Kaynar, Frits Vaandrager, Nancy Lynch e Roberto Segala

37,09€ + 10% CARD

 Table of Contents: Introduction / Mathematical Preliminaries / Describing Timed System Behavior / Timed Automata / Operations on Timed Automata / Properties for Timed Automata / Timed I/O Automata / Operations on Timed I/O Automata / Conclusions and Future Work
ENGLISH

Fault-Tolerant Agreement In Synchronous Message-Passing Systems

by Michel Raynal

39,74€ + 10% CARD

 Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. A previous book Communication and Agreement Abstraction for Fault-tolerant Asynchronous Distributed Systems (published by Morgan & Claypool, 2010) was devoted to the problems created by crash failures in asynchronous message-passing systems. The present book focuses on the way to cope with the uncertainty created by process failures (crash, omission failures and Byzantine behavior) in synchronous message-passing systems (i.e., systems whose progress is governed by the passage of time). To that end, the book considers fundamental problems that distributed synchronous processes have to solve. These fundamental problems concern agreement among processes (if processes are unable to agree in one way or another in presence of failures, no non-trivial problem can be solved). They are consensus, interactiveconsistency, k-set agreement and non-blocking atomic commit. Being able to solve these basic problems efficiently with provable guarantees allows applications designers to give a precise meaning to the words ""cooperate"" and ""agree"" despite failures, and write distributed synchronous programs with properties that can be stated and proved. Hence, the aim of the book is to present a comprehensive view of agreement problems, algorithms that solve them and associated computability bounds in synchronous message-passing distributed systems. Table of Contents: List of Figures / Synchronous Model, Failure Models, and Agreement Problems / Consensus and Interactive Consistency in the Crash Failure Model / Expedite Decision in the Crash Failure Model / Simultaneous Consensus Despite Crash Failures / From Consensus to k-Set Agreement / Non-Blocking Atomic Commit in Presence of Crash Failures / k-Set Agreement Despite Omission Failures / Consensus Despite Byzantine Failures / Byzantine Consensusin Enriched Models
ENGLISH

Impossibility Results For Distributed Computing

by Faith Ellen e Hagit Attiya

43,71€ + 10% CARD

 To understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space).
ENGLISH

Introduction To Distributed Self-Stabilizing Algorithms

by Franck Petit, Karine Altisen, Stéphane Devismes e Swan Dubois

72,86€ + 10% CARD

 This book aims at being a comprehensive and pedagogical introduction to the concept of self-stabilization, introduced by Edsger Wybe Dijkstra in 1973. Self-stabilization characterizes the ability of a distributed algorithm to converge within finite time to a configuration from which its behavior is correct (i.e., satisfies a given specification), regardless the arbitrary initial configuration of the system. This arbitrary initial configuration may be the result of the occurrence of a finite number of transient faults. Hence, self-stabilization is actually considered as a versatile non-masking fault tolerance approach, since it recovers from the effect of any finite number of such faults in an unified manner. Another major interest of such an automatic recovery method comes from the difficulty of resetting malfunctioning devices in a large-scale (and so, geographically spread) distributed system (the Internet, Pair-to-Pair networks, and Delay Tolerant Networks are examples of such distributed systems). Furthermore, self-stabilization is usually recognized as a lightweight property to achieve fault tolerance as compared to other classical fault tolerance approaches. Indeed, the overhead, both in terms of time and space, of state-of-the-art self-stabilizing algorithms is commonly small. This makes self-stabilization very attractive for distributed systems equipped of processes with low computational and memory capabilities, such as wireless sensor networks.After more than 40 years of existence, self-stabilization is now sufficiently established as an important field of research in theoretical distributed computing to justify its teaching in advanced research-oriented graduate courses. This book is an initiation course, which consists of the formal definition of self-stabilization and its related concepts, followed by a deep review and study of classical (simple) algorithms, commonly used proof schemes and design patterns, as well as premium results issued from the self-stabilizing community. As often happens in the self-stabilizing area, in this book we focus on the proof of correctness and the analytical complexity of the studied distributed self-stabilizing algorithms.Finally, we underline that most of the algorithms studied in this book are actually dedicated to the high-level atomic-state model, which is the most commonly used computational model in the self-stabilizing area. However, in the last chapter, we present general techniques to achieve self-stabilization in the low-level message passing model, as well as example algorithms.
ENGLISH

Mobile Agent Rendezvous Problem In The Ring

by Danny Krizanc, Euripides Marcou e Evangelos Kranakis

37,09€ + 10% CARD

 Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Table of Contents: Models for Mobile Agent Computing / Deterministic Rendezvous in a Ring / Multiple Agent Rendezvous in a Ring / Randomized Rendezvous in a Ring / Other Models / Other Topologies
ENGLISH

Consistent Distributed Storage

by Alexander A. Schwarzmann, Nicolas Nicolaou e Vincent Gramoli

74,34€ + 10% CARD

free shipping

 Providing a shared memory abstraction in distributed systems is a powerful tool that can simplify the design and implementation of software systems for networked platforms. Emulations of shared atomic memory in distributed systems is an active area of research and development.
ENGLISH

Network Topology And Fault-Tolerant Consensus

by Dimitris Sakavalas e Lewis Tseng

74,34€ + 10% CARD

free shipping

 As the structure of contemporary communication networks grows more complex, practical networked distributed systems become prone to component failures.
ENGLISH

Decidability Of Parameterized Verification

by Ayrat Kalimov, Igor Konnov, Roderick Bloem e Swen Jacobs

54,06€ + 10% CARD

free shipping

 While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems ????(n) parameterized by n ? N, whether, for all n ? N, the system ????(n) satisfies a specification.
ENGLISH

Impossibility Results For Distributed Computing

by Faith Ellen e Hagit Attiya

44,60€ + 10% CARD

free shipping

 To understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space).
ENGLISH

Quorum Systems - With Applications To Storage And Consensus

by Marko Vukolic

40,55€ + 10% CARD

free shipping

 A quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems
ENGLISH

Introduction To Distributed Self-Stabilizing Algorithms

by Franck Petit, Karine Altisen, Stéphane Devismes e Swan Dubois

74,34€ + 10% CARD

free shipping
ENGLISH

Distributed Computing Pearls

by Gadi Taubenfeld

74,34€ + 10% CARD

free shipping
ENGLISH

Principles Of Transactional Memory

by Michael Kapalka e Rachid Guerraoui

40,55€ + 10% CARD

free shipping
ENGLISH

Concurrent Crash-Prone Shared Memory Systems - A Few Theoretical Notions

by Michel Raynal

74,34€ + 10% CARD

free shipping
ENGLISH

Concurrent Crash-Prone Shared Memory Systems - A Few Theoretical Notions

by Michel Raynal

OUT OF STOCK OR NOT AVAILABLE

 Considering systems built on top of an asynchronous read/write shared memory prone to process crashes, this monograph presents the fundamental notions that are universal constructions, consensus numbers, distributed recursivity, power of the BG simulation, and what can be done when one has to cope with process anonymity and/or memory anonymity.
ENGLISH

Distributed Computing By Oblivious Mobile Robots

by Giuseppe Prencipe, Nicola Santoro e Paola Flocchini

46,36€ + 10% CARD

 The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other Directions
ENGLISH

Network Topology And Fault-Tolerant Consensus

by Dimitris Sakavalas e Lewis Tseng

72,86€ + 10% CARD

 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.
ENGLISH

Distributed Graph Coloring - Fundamentals And Recent Developments

by Leonid Barenboim e Michael Elkin

43,71€ + 10% CARD

 The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. A typical symmetry-breaking problem is the problem of graph coloring. Other typical symmetry-breaking problems are the problems of computing a maximal independent set (MIS) and a maximal matching (MM).
ENGLISH

Link Reversal Algorithms

by Jennifer Walter e Jennifer Welch

37,09€ + 10% CARD

 Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yetto be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion
Loading results...

View more results