| 청구기호 |
QA76.9.D5 |
| 형태사항 |
360 p.
|
| 총서명 |
SIAM Monographs on Discrete Mathematics and Applications ; 5
|
| 언어 |
English |
| 내용 |
DISTRIBUTED COMPUTING:A Locality-Sensitive Approach -- Contents -- Preface -- Chapter 1 Introduction -- Part I Basics of distributed network algorithms -- Chapter 2 The distributed network model -- Chapter 3 Broadcast and convergecast -- Chapter 4 Downcasts and upcasts -- Chapter 5 Tree constructions -- Chapter 6 Synchronizers -- Chapter 7 Vertex coloring -- Chapter 8 Maximal independent sets (MIS) -- Chapter 9 Message routing -- Chapter 10 Local queries and local resource finding -- Part II Locality-preserving representations -- Chapter 11 Clustered representations:Clusters, covers and partitions -- Chapter 12 Sparse covers -- Chapter 13 Sparse partitions -- Chapter 14 Related graph representations -- Chapter 15 Skeletal representations:Spanning trees, tree covers and spanners -- Chapter 16 Sparse spanners for unweighted graphs -- Chapter 17 Light-weight spanners -- Chapter 18 Spanners with low average stretch -- Chapter 19 Proximity-preserving labeling systems -- Part III Distributed constructions and applications of LP-representations -- Chapter 20 A basic algorithm for constructing network partitions -- Chapter 21 Efficient algorithms for constructing covers -- Chapter 22 Efficient algorithms for constructing network decompositions -- Chapter 23 Exploiting topological knowledge: Broadcast revisited -- Chapter 24 How local are global tasks? MST revisited -- Chapter 25 Local coordination:Synchronizers and MIS revisited -- Chapter 26 Hierarchical cluster-based routing -- Chapter 27 Regional directories: Resource finding revisited -- Chapter 28 Additional applications in other settings -- Bibliography -- Index
|
| 주제 |
Electronic data processing--Distributed processing.
|
| ISBN |
0898714648
, 9780898714647
|
| QR CODE |
|
