|
|
1 | (6) |
|
|
1 | (1) |
|
|
2 | (5) |
|
Part I The Telegraph and Telephone Modes |
|
|
|
|
7 | (44) |
|
|
7 | (1) |
|
|
7 | (13) |
|
|
20 | (5) |
|
Communication Tasks and Algorithms |
|
|
25 | (8) |
|
General Properties of the Complexity of Communication Algorithms |
|
|
33 | (8) |
|
Fundamental Interconnection Networks |
|
|
41 | (10) |
|
|
51 | (42) |
|
|
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) |
|
|
79 | (14) |
|
|
80 | (2) |
|
Two Approximation Algorithms |
|
|
82 | (8) |
|
|
90 | (3) |
|
|
93 | (44) |
|
|
93 | (1) |
|
|
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) |
|
|
134 | (3) |
|
|
137 | (46) |
|
|
137 | (2) |
|
|
139 | (4) |
|
|
143 | (2) |
|
General Observations for Systolic Gossip |
|
|
145 | (2) |
|
|
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) |
|
|
172 | (3) |
|
Systolic Gossip on Butterfly and CCC Networks |
|
|
175 | (5) |
|
|
180 | (3) |
|
|
183 | (46) |
|
|
183 | (3) |
|
|
184 | (1) |
|
|
185 | (1) |
|
Flexibility of Broadcasting Algorithms |
|
|
186 | (1) |
|
|
186 | (4) |
|
|
190 | (21) |
|
|
190 | (3) |
|
|
193 | (8) |
|
|
201 | (10) |
|
The Probabilistic Fault Model |
|
|
211 | (18) |
|
|
211 | (5) |
|
|
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) |
|
|
246 | (11) |
|
|
246 | (4) |
|
|
250 | (3) |
|
The Growth of the Core Graph |
|
|
253 | (4) |
|
|
257 | (10) |
|
|
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) |
|
|
290 | (4) |
|
|
294 | (3) |
|
Leader Election on Hypercubes |
|
|
297 | (18) |
|
|
297 | (1) |
|
|
298 | (1) |
|
|
298 | (2) |
|
|
300 | (15) |
|
Leader Election on Synchronous Rings |
|
|
315 | (2) |
|
Fault-Tolerant Broadcast in Distributed Networks |
|
|
317 | (24) |
|
|
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 | |