Dreadfully Ever After Sale
 
 

Recently Viewed clear list


Original Essays | September 30, 2014

Brian Doyle: IMG The Rude Burl of Our Masks



One day when I was 12 years old and setting off on my newspaper route after school my mom said will you stop at the doctor's and pick up something... Continue »
  1. $13.27 Sale Trade Paper add to wish list

    Children and Other Wild Animals

    Brian Doyle 9780870717543

spacer
Qualifying orders ship free.
$166.50
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
1 Remote Warehouse Software Engineering- Programming and Languages

Distributed Algorithms (Morgan Kaufmann Series in Data Management Systems)

by

Distributed Algorithms (Morgan Kaufmann Series in Data Management Systems) Cover

 

Synopses & Reviews

Publisher Comments:

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.

Book News Annotation:

This introduction to the field of distributed algorithms presents a collection of the most significant algorithms and impossibility results in a simple automata-theoretic setting. Problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, and global snapshots. Material is organized by the system model--first by the timing model and then by the interprocess communication mechanism.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

correctness, and evaluate their performance with realistic measures.

Synopsis:

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.

About the Author

and verification of distributed systems.

Table of Contents

sion with Partial Synchrony

25 Consensus with Partial Synchrony

Product Details

ISBN:
9781558603486
Author:
Lynch, Nancy
Author:
Lynch
Author:
Lynch, Nancy A.
Publisher:
Morgan Kaufmann Publishers
Location:
San Francisco, Calif. :
Subject:
Programming Languages - General
Subject:
Programming - General
Subject:
Electronic data processing
Subject:
Information Storage & Retrieval
Subject:
Computer algorithms
Subject:
Ccmputer algcrathms
Subject:
Electronic data processing -- Distributed processing.
Subject:
Database Management - General
Subject:
System Administration - Storage & Retrieval
Subject:
Software Engineering - Programming and Languages
Series:
Morgan Kaufmann Series in Data Management Systems
Series Volume:
1132
Publication Date:
19960331
Binding:
HARDCOVER
Language:
English
Illustrations:
Yes
Pages:
904
Dimensions:
9.52x7.70x1.80 in. 3.60 lbs.

Other books you might like

  1. Introduction to Distributed Algorithms New Trade Paper $103.25
  2. The Art of Computer Programming, 2nd... Used Hardcover $44.00
  3. Ml for the Working Programmer 2ND... Used Trade Paper $30.00
  4. Mathew Brady (55) Used Trade Paper $2.95
  5. Open Source Development With CVS 1ST... Used Trade Paper $6.95

Related Subjects

Computers and Internet » Computer Architecture » General
Computers and Internet » Computers Reference » General
Computers and Internet » Internet » Information
Computers and Internet » Software Engineering » Algorithms
Computers and Internet » Software Engineering » Programming and Languages
Health and Self-Help » Health and Medicine » General
Health and Self-Help » Health and Medicine » General Medicine
Health and Self-Help » Health and Medicine » Medical Specialties
History and Social Science » Military » General History
History and Social Science » World History » General
Religion » Comparative Religion » General

Distributed Algorithms (Morgan Kaufmann Series in Data Management Systems) New Hardcover
0 stars - 0 reviews
$166.50 In Stock
Product details 904 pages Morgan Kaufmann Publishers - English 9781558603486 Reviews:
"Synopsis" by , correctness, and evaluate their performance with realistic measures.
"Synopsis" by , 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.

spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.