Self-Stabilizing Systems
5th International Workshop, WSS 2001, Lisbon, Portugal, October 1-2, 2001 Proceedings (Lecture Notes in Computer Science)
1 edition
Our rough guess is there are 57,250 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 49 minutes to read. With a half hour per day, this will take 8 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Ajoy K. Datta (Editor) - Contributor
- Ted Herman (Editor) - Contributor
Publication
2001-10-25 - Springer
Language
English
Word Count
57,250 words, Guess
Page Count
229 pages
Physical Format
Paperback
Identifiers
- Internet Archiveselfstabilizings00datt
- ISBN-103540426531
- ISBN-139783540426530
- Library of Congress Control Number2001049767
- OCLC Control Number48038041
and 3 more
- Better World Books9783540426530
- Better World BooksKT-341-772
- Open LibraryOL9805466M
Classifications
- LCCQA76.9.S54 W77 2001
- LCCQA75.5-76.95
Description
Physicalsystemswhichrightthemselvesafterbeingdisturbedevokeourcuriosity becausewe wantto understand howsuchsystemsareableto reactto unexpected stimuli. Themechanismsareallthe morefascinatingwhensystemsarecomposed of small, simple units, and the ability of the system to self-stabilize emerges out of its components. Faithful computer simulations of such physical systems exhibit the self-stabilizing property, but in the realm of computing, particularly for distributed systems, wehavegreaterambition. We imaginethat all manner of software, ranging from basic communication protocols to high-level applications, could enjoy self-corrective properties. Self-stabilizing software o?ers a unique, non-traditional approach to the c- cial problem of transient fault tolerance. Many successful instances of modern fault-tolerant networks are based on principles of self-stabilization. Surprisingly, the most widely accepted technical de?nition of a self-stabilizing system does not refer to faults: it is the property that the system can be started in any i- tial state, possibly an “illegal state,” and yet the system guarantees to behave properly in ?nite time. This, and similar de?nitions, break many traditional approaches to program design, in which the programmer by habit makes - sumptions about initial conditions. The composition of self-stabilizing systems, initially seen as a daunting challenge, has been transformed into a mana- able task, thanks to an accumulation of discoveries by many investigators. - search on various topics in self-stabilization continues to supply new methods for constructing self-stabilizing systems, determines limits and applicability of the paradigm of self-stabilization, and connects self-stabilization to related areas of fault tolerance and distributed computing.
First Sentence
Consider the execution of a program on a network of processes.
Subjects
Topics
Other Editions
- Self-Stabilizing Systems: 5th International Workshop, WSS 2001, Lisbon, Portugal, October 1-2, 2001 Proceedings (Lecture Notes in Computer Science)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!