Atjaunināt sīkdatņu piekrišanu

Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance 2005 ed. [Hardback]

  • Formāts: Hardback, 364 pages, height x width: 235x155 mm, weight: 1560 g, 73 Illustrations, black and white; XIV, 364 p. 73 illus., 1 Hardback
  • Sērija : Texts in Theoretical Computer Science. An EATCS Series
  • Izdošanas datums: 18-Feb-2005
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540008462
  • ISBN-13: 9783540008460
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Hardback, 364 pages, height x width: 235x155 mm, weight: 1560 g, 73 Illustrations, black and white; XIV, 364 p. 73 illus., 1 Hardback
  • Sērija : Texts in Theoretical Computer Science. An EATCS Series
  • Izdošanas datums: 18-Feb-2005
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540008462
  • ISBN-13: 9783540008460
Citas grāmatas par šo tēmu:
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 involvedtextbookIntroductiontoParallelAlgorithmsandArchitecturesby 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.

Recenzijas

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)

Introduction
1(6)
Motivation and Aims
1(1)
Organization of the Book
2(5)
Part I The Telegraph and Telephone Modes
Fundamentals
7(44)
Introduction
7(1)
Graphs
7(13)
Combinatorics
20(5)
Communication Tasks and Algorithms
25(8)
General Properties of the Complexity of Communication Algorithms
33(8)
Fundamental Interconnection Networks
41(10)
Broadcasting
51(42)
Introduction
51(1)
Basic Facts and Techniques
52(7)
Upper Bounds for Common Networks
59(7)
Lower Bounds for Bounded-Degree Graphs
66(12)
Overview on Broadcasting in Concrete Networks
78(1)
Approximation Algorithms
79(14)
General Observations
80(2)
Two Approximation Algorithms
82(8)
Bibliographical Remarks
90(3)
Gossiping
93(44)
Introduction
93(1)
General Observations
94(6)
Gossiping in Graphs with Small Bisection Width
100(23)
Gossiping in Hypercube-like Networks of Constant Degree
123(3)
Gossiping in Complete Graphs
126(8)
Overview
134(3)
Systolic Communication
137(46)
Introduction
137(2)
Definitions
139(4)
Systolic Broadcast
143(2)
General Observations for Systolic Gossip
145(2)
Special Systolic Modes
147(1)
Systolic Gossip in Concrete Networks
148(32)
Systolic Gossip on a Path
149(12)
Systolic Gossip on a Cycle
161(1)
Systolic Gossip on Complete Trees
162(10)
Systolic Gossip on Grids
172(3)
Systolic Gossip on Butterfly and CCC Networks
175(5)
Bibliographical Remarks
180(3)
Fault-Tolerance
183(46)
Introduction
183(3)
Fault Distribution
184(1)
Fault Classification
185(1)
Flexibility of Broadcasting Algorithms
186(1)
Preliminary Results
186(4)
The Bounded-Fault Model
190(21)
Permanent Link Faults
190(3)
Permanent Node Faults
193(8)
Transmission Faults
201(10)
The Probabilistic Fault Model
211(18)
Crash Faults
211(5)
Byzantine Faults
216(13)
Part II Distributed Networks
Broadcast on Distributed Networks
229(38)
Broadcasting on General Networks
229(17)
Distributed Depth-First Search
229(6)
Distributed Breadth-First Search
235(5)
Basic Lower Bound on Message Complexity of Broadcast
240(6)
Broadcast on Tori
246(11)
Upper Bound
246(4)
Lower Bound
250(3)
The Growth of the Core Graph
253(4)
Broadcast on Hypercubes
257(10)
Preliminaries
257(2)
Partial Broadcasting and Orientation
259(2)
Bit-Efficient Partial Broadcasting Algorithm
261(2)
Applications -- Optimal Computable Masks for Special Target Sets
263(2)
The Broadcasting Algorithm
265(1)
Bit-Optimal Broadcasting in Time n
266(1)
Leader Election in Asynchronous Distributed Networks
267(50)
Distributed Point-to-Point Network Model
267(4)
Leader Election on Distributed Networks
271(1)
Leader Election on Unidirectional Rings with Optimal Average Performance
271(5)
Leader Election on Unidirectional Rings -- Worst Case Analysis
276(7)
Leader Election on Bidirectional Rings -- Worst Case Analysis
283(7)
Election Algorithm Due to van Leeuwen and Tan
285(2)
Correctness and Message Complexity Analysis
287(3)
Leader Election on Complete Networks
290(7)
O(N log N) Algorithm
290(4)
Ω(N log N) Lower Bound
294(3)
Leader Election on Hypercubes
297(18)
Preliminary Notions
297(1)
Leader Election
298(1)
Warrior Phase
298(2)
King Phase
300(15)
Leader Election on Synchronous Rings
315(2)
Fault-Tolerant Broadcast in Distributed Networks
317(24)
Consensus Problem
317(9)
Fault-Tolerant Broadcast with Unsigned Messages
319(4)
Fault-Tolerant Broadcast with Signed Messages
323(3)
Broadcasting in Synchronous Networks with Dynamic Faults
326(15)
Broadcast in Hypercubes with Dynamic Faults
330(3)
Broadcast in Tori with Dynamic Faults
333(4)
Broadcast in Star Graphs with Dynamic Faults
337(4)
References 341(16)
Index 357