Cooperative task-oriented computing
algorithms and complexity
Our rough guess is there are 38,750 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 35 minutes to read. With a half hour per day, this will take 5 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
- Shvartsman, Alex Allister - Contributor
Publication
2011 - Morgan & Claypool, San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA), California
Language
English
Word Count
38,750 words, Guess
Page Count
155 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivecooperativetasko00geor
- Internet Archivecooperativetasko0000geor
- ISBN-139781608452880
- ISBN-139781608452873
- ISBN-101608452883
and 5 more
- ISBN-101608452875
- OCLC Control Number759114691
- Better World Books9781608452873
- Better World Books9781608452880
- Open LibraryOL25568168M
Classifications
- DDC004.36
- LCCQA76.9.D5 G463 2011
- LCCQA76.9.D5 G46 2011
Alternate Titles
- Synthesis digital library of engineering and computer science.
Description
Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions.
Subjects
Series Statement
- Synthesis lectures on distributed computing theory -- # 7
Other Editions
- Cooperative task-oriented computing: algorithms and complexity
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!