
Distributed Algorithms by Nancy A Lynch
In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model - first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms - to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.-
Data Modeling Essentials
-
Data Mining
-
Business Process Change
-
Joe Celko's SQL for Smarties
-
Enterprise Knowledge Management
-
Joe Celko's SQL Puzzles and Answers
-
IT Manager's Handbook
-
Joe Celko's Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL
-
Information Modeling and Relational Databases
-
TCP/IP Sockets in Java
-
SQL
-
Database Design for Smarties
-
Querying XML
-
Principles of Transaction Processing for the Systems Professional
-
Data Mining: Concepts and Techniques
-
Relational Database Design Clearly Explained
-
Building an Object-Oriented Database System
-
Java Data Mining: Strategy, Standard, and Practice
-
Data Mining, Southeast Asia Edition
-
XML for Data Architects
-
Temporal Data & the Relational Model
-
Atomic Transactions
-
Engineering Global E-Commerce Sites
-
Data Warehousing And Business Intelligence For e-Commerce
-
The Object Data Standard
-
Maintaining and Evolving Successful Commercial Web Sites
-
Advanced SQL:1999
-
Data Warehousing
-
Object Database Standard
-
Database Modeling and Design
-
Camelot and Avalon
-
Managing Reference Data in Enterprise Databases
-
Business Modeling and Data Mining
-
A Complete Guide to DB2 Universal Database
-
Fuzzy Modeling and Genetic Algorithms for Data Mining and Exploration
About the author:Nancy A. Lynch is a professor of electrical engineering and computer science at MIT and heads MIT's Theory of Distributed Systems research group. She is the author of numerous research articles about distributed algorithms and impossibility results, and about formal modeling and verification of distributed systems.
| SKU | Unavailable |
| ISBN 13 | 9781558603486 |
| ISBN 10 | 1558603484 |
| Title | Distributed Algorithms |
| Author | Nancy A Lynch |
| Series | The Morgan Kaufmann Series In Data Management Systems |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Elsevier Science & Technology |
| Year published | 1996-04-16 |
| Number of pages | 912 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |


































