Distributed algorithms (Record no. 6458)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02227 a2200181 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 1558603484 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | 8053206 |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) | |
| -- | 2533 |
| -- | 2533 |
| 100 10 - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Lynch, Nancy A |
| 245 10 - TITLE STATEMENT | |
| Title | Distributed algorithms |
| Statement of responsibility, etc. | / Nancy A. Lynch. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | India |
| Name of publisher, distributor, etc. | : Morgan Kaufmann Publishers |
| Date of publication, distribution, etc. | , c1996. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xxiii, 872 p. |
| Other physical details | : ill. |
| 440 #0 - SERIES STATEMENT/ADDED ENTRY--TITLE | |
| Title | Morgan Kaufmann series in data management systems. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Electronic data processing |
| General subdivision | Distributed processing. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer algorithms. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Book |
| Call number prefix | 005.276 LYN |
| Withdrawn status | Lost status | Damaged status | Not for loan | Collection code | Permanent Location | Current Location | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library (CL) | Central Library (CL) | First Floor - Software Engineering/ Programming Language | 12/19/2003 | Allied Book Company | 537.47 | 005.276 LYN | SEECS004039 | 11/14/2012 | 01/05/2017 | Book |