Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Springer Science & Business Media, Feb 18, 2005 - Computers - 364 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
algorithm for G Approximation algorithms assume bisection width Bratislava breadth-first search broadcast algorithm broadcasting scheme called collision communication algorithm complete graph Computer Science connected consider cumulative message cycle deﬁne Deﬁnition delay denote diameter distributed distributed algorithm domain edge envelope execution Exercise fault free fault-free nodes ﬁrst gossip algorithm graph G Hence hypercube ID’s induction integer interconnection networks k-ary tree k-tolerant broadcasting king kingdom Královic label least Lecture Notes Lemma length Let G log2 logN lower bound messages sent neighbors Notes in Computer number of messages number of nodes number of rounds one-way mode parallel path pattern phase piece of information positive integer Proc procedure processor Proof prove root Ruzicka Section sends sequence Slovak source message spanning tree Springer stage step subtree supernode synchronous systolic gossip Theorem time-paths total number two-way mode upper bound vertex vertices