Features
- Cover Type: Hard Cover with 359 pages
- Published by: Society for Industrial Mathematics January 1, 1987
- Written in: English
- ISBN 10 Number: 0898714648
- ISBN 13 Number: 978-0898714647
-
Book Dimensions:
10.2 x 7.1 x 1 inches
- Weighs: 1.6 pounds
Book Description
This volume presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Distributed Computing: A Locality-Sensitive Approach is the only book that gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists.
About The Author
David Peleg is the Norman D. Cohen Professorial Chair of Computer Sciences at the Weizmann Institute of Science, Rehovot, Israel.
Search for books at
