Distributed algorithm

Author: Nancy A. Lynch
Publisher:
Publish Date: 2004-01-01
Features: The content of this book is organized according to a systematic model, first based on the timing model, and then within the timing model, according to inter-process communication mechanisms. Materials for different systems are independently organized into chapters for easy reference. The book is rigorous yet intuitive, making it easy for readers to grasp quickly. It also provides readers with the fundamental mathematical tools for designing new algorithms and proving new impossibility results. The book offers a comprehensive introduction to distributed algorithms, including the most important algorithms and impossibility results. Most solutions are mathematically proven. These algorithms are analyzed based on precisely defined complexity metrics. The book also discusses algorithms for many typical problems, various system models, and their capabilities. Numerous exercises are provided at the end of each chapter, along with detailed references. This book can serve as a textbook for computer system graduate students in higher education institutions, especially suitable for students interested in computer theory or architecture. It is also a valuable reference for distributed designers, researchers, and related technical professionals.