Link reversal algorithms
Our rough guess is there are 23,250 words in this book.
At a pace averaging 250 words per minute, this book will take 1 hours and 33 minutes to read. With a half hour per day, this will take 3 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
- Walter, Jennifer E. - Contributor
Publication
2012 - Morgan & Claypool, San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA), California
Language
English
Word Count
23,250 words, Guess
Page Count
93 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivelinkreversalalgo00ewal
- ISBN-139781608450428
- ISBN-139781608450411
- ISBN-101608450422
- ISBN-101608450414
and 4 more
- OCLC Control Number761110154
- Better World Books9781608450411
- Better World Books9781608450428
- Open LibraryOL25557654M
Classifications
- DDC004.36
- LCCQA76.9.D5 W455 2012
Alternate Titles
- Synthesis digital library of engineering and computer science.
Description
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.
Subjects
Topics
Other Editions
- Link reversal algorithms
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!