Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)

Unger, Walter,Ruzicka, Peter,Pelc, A.,Klasing, Ralf,Hromkovic, Juraj

ISBN 10: 3540008462 / ISBN 13: 9783540008460

Published by Springer, 2005

About this Item

May contain highlighting/underlining/notes/etc. May have used stickers on cover. Access codes and supplements are not guaranteed to be included with used books. Ships same or next day. Expedited shipping: 3-5 business days, Standard shipping: 4-14 business days.

Seller Inventory # mon0000104830

Bibliographic Details

• Title: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
• Publisher: Springer
• Publication Date: 2005
• Language: English
• ISBN 10: 3540008462
• ISBN 13: 9783540008460
• Binding: Hardcover
• Condition: Good

About this title

Synopsis

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 forwriting this book.

Review

From the reviews:

"The book covers the complexity of communication to disseminate information in networks. ... The book surveys the state of the art of broadcasting and gossiping in the telegraph and telephone modes of communication. ... appears to be especially useful to researchers in the field. ... The exposition is self-contained, including specialized topics." (Bogdan S. Chlebus, Mathematical Reviews, Issue 2008 c)