MARC Record from marc_columbia

LEADER: 03926mam a2200337 a 4500
001 1776140
005 20220608232928.0
008 960412t19961996caua b 001 0 eng d
020 $a1558603484
035 $a(OCoLC)ocm34562544
035 $9ALK1665CU
035 $a1776140
040 $aCLU$cCLU$dOrLoB-B
100 1 $aLynch, Nancy A.$q(Nancy Ann),$d1948-$0http://id.loc.gov/authorities/names/n86848868
245 10 $aDistributed algorithms /$cNancy A. Lynch.
260 $aSan Francisco, Calif. :$bMorgan Kaufmann Publishers,$c[1996], ©1996.
300 $axxiii, 872 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aThe Morgan Kaufmann series in data management systems
504 $aIncludes bibliographical references (p. [829]-856) and index.
505 20 $g1.$tIntroduction --$g2.$tModelling I: Synchronous Network Model --$g3.$tLeader Election in a Synchronous Ring --$g4.$tAlgorithms in General Synchronous Networks --$g5.$tDistributed Consensus with Link Failures --$g6.$tDistributed Consensus with Process Failures --$g7.$tMore Consensus Problems --$g8.$tModelling II: Asynchronous System Model --$g9.$tModelling III: Asynchronous Shared Memory Model --$g10.$tMutual Exclusion --$g11.$tResource Allocation --$g12.$tConsensus --$g13.$tAtomic Objects --$g14.$tModelling IV: Asynchronous Network Model --$g15.$tBasic Asynchronous Network Algorithms --$g16.$tSynchronizers --$g17.$tShared Memory versus Networks --$g18.$tLogical Time --$g19.$tGlobal Snapshots and Stable Properties --$g20.$tNetwork Resource Allocation --$g21.$tAsynchronous Networks with Process Failures --$g22.$tData Link Protocols --$g23.$tPartially Synchronous System Models --$g24.$tMutual Exclusion with Partial Synchrony --$g25.$tConsensus with Partial Synchrony.
520 $aIn 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.
520 8 $aDistributed 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.
520 8 $aThe 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.
520 8 $aThe 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.
520 8 $aThe 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 $aElectronic data processing$xDistributed processing.$0http://id.loc.gov/authorities/subjects/sh85042293
650 0 $aAlgorithms.$0http://id.loc.gov/authorities/subjects/sh85003487
830 0 $aMorgan Kaufmann series in data management systems.$0http://id.loc.gov/authorities/names/n90627178
852 00 $boff,eng$hQA76.9.D5$iL96 1996g