Dissemination of Information in Communication Networks
Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
1 edition
Our rough guess is there are 90,250 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 1 minutes to read. With a half hour per day, this will take 12 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.
Publication
2005-04-06 - Springer
Language
English
Word Count
90,250 words, Guess
Page Count
361 pages
Physical Format
Hardcover
Identifiers
- Open LibraryOL9053878M
- ISBN-139783540008460
- ISBN-103540008462
- OCLC Control Number56654303
- LibraryThing6363872
and 1 more
- Goodreads2017631
Classifications
- LCCQA76.9.D5 D46 2005eb
Description
Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents,severalbooksonparallelcomputingwerewritten. The involvedtextbook“IntroductiontoParallelAlgorithmsandArchitectures”by F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality – the world of interconnected computers that cooperate (often asynchronously) in order to solve di?erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi?erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation for writing this book.
Subjects
Topics
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!