Introduction to Distributed Self-Stabilizing Algorithms (Synthesis Lectures on Distributed Computing Theory) - Image 1

£46.71

Springer Introduction to Distributed Self-Stabilizing Algorithms (Synthesis Lectures on Distributed Computing Theory)

Name: Introduction to Distributed Self-Stabilizing Algorithms (Synthesis Lectures on Distributed Computing Theory)
Brand: Springer
Price: 46.71 GBP
Availability: InStock

Information Systems

This is the most expensive it has ever been. Walk away.

£47 today · previous high £47 · all-time low £47

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 29 days • 29 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 29 days • 1 price levels

Days at Price

Price Analysis

Most common price: £47 (29 days, 100.0%)

Price range: £47 - £47

Price levels: 1 different prices over 29 days

Description

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3031008855
Category: Books > Subjects > Computing & Internet > Computer Science > Information Systems
Domain: Amazon UK
Release Date: 15 April 2019
Listed Since: 01 June 2022

Barcode

No barcode data available

Springer Introduction to Distributed Self-Stabilizing Algorithms (Synthesis Lectures on Distributed Computing Theory)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Understanding Concurrent Systems (Texts in Computer Science)

Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings: 5873 (Lecture Notes in Computer Science, 5873)

Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)

Models and Analysis for Distributed Systems

Discrete Networked Dynamic Systems: Analysis and Performance

Dynamics of Information Systems: Algorithmic Approaches: 51 (Springer Proceedings in Mathematics & Statistics, 51)

Max-Plus Linear Stochastic Systems and Perturbation Analysis: 15 (The International Series on Discrete Event Dynamic Systems, 15)

Quantum Game Simulation: 36 (Emergence, Complexity and Computation, 36)

Principles of Cyber-Physical Systems

Self-organising Software: From Natural to Artificial Adaptation (Natural Computing Series)

Diagnosis of Active Systems: Principles and Techniques: 741 (The Springer International Series in Engineering and Computer Science, 741)

Data Prefetching Techniques in Computer Systems: Volume 125 (Advances in Computers, Volume 125)

Distributed Computing Through Combinatorial Topology

Cellular Automata in Image Processing and Geometry: 10 (Emergence, Complexity and Computation, 10)

Fault-Tolerant Design and Control of Automated Vehicles and Processes: Insights for the Synthesis of Intelligent Systems: 201 (Studies in Systems, Decision and Control, 201)

Quality of Communication-Based Systems: Proceedings of an International Workshop Held at the TU, Berlin, Germany, September 1994

Semi-Markov Models: Control of Restorable Systems with Latent Failures

Advances in Intelligent Control Systems and Computer Science: 187 (Advances in Intelligent Systems and Computing, 187)

Self-Aware Computing Systems

Reconfigurable and Adaptive Computing: Theory and Applications

Self-organising Multi-agent Systems: Algorithmic Foundations Of Cyber-anarcho-socialism

STACS 93: 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993. Proceedings: 665 (Lecture Notes in Computer Science, 665)

From Boolean Logic to Switching Circuits and Automata: Towards Modern Information Technology: 335 (Studies in Computational Intelligence, 335)

Performance and Reliability Analysis of Computer Systems: An Example-Based Approach Using the SHARPE Software Package