|
|
|
|
| LEADER |
03565nmm a2200397 u 4500 |
| 001 |
EB000372992 |
| 003 |
EBX01000000000000000226044 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540266631
|
| 100 |
1 |
|
|a Hromkovič, Juraj
|
| 245 |
0 |
0 |
|a Dissemination of Information in Communication Networks
|h Elektronische Ressource
|b Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
|c by Juraj Hromkovič, Ralf Klasing, A. Pelc, Peter Ruzicka, Walter Unger
|
| 250 |
|
|
|a 1st ed. 2005
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2005, 2005
|
| 300 |
|
|
|a XIV, 364 p. 73 illus
|b online resource
|
| 505 |
0 |
|
|a The Telegraph and Telephone Modes -- Fundamentals -- Broadcasting -- Gossiping -- Systolic Communication -- Fault-Tolerance -- Distributed Networks -- Broadcast on Distributed Networks -- Leader Election in Asynchronous Distributed Networks -- Fault-Tolerant Broadcast in Distributed Networks
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Mathematical statistics
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Probability and Statistics in Computer Science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Computer networks
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Klasing, Ralf
|e [author]
|
| 700 |
1 |
|
|a Pelc, A.
|e [author]
|
| 700 |
1 |
|
|a Ruzicka, Peter
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Texts in Theoretical Computer Science. An EATCS Series
|
| 028 |
5 |
0 |
|a 10.1007/b137871
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b137871?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.6
|
| 520 |
|
|
|a 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
|