000 | 01255nam a22001457a 4500 | ||
---|---|---|---|
008 | 210120b ||||| |||| 00| 0 eng d | ||
020 | _a978-81-8147-964-8 | ||
082 |
_223 _a005.276 _bLYN |
||
100 | _aLynch Nancy A | ||
245 |
_aDistributed Algorithms _cNancy A. Lynch _hEnglish |
||
260 |
_aNew Delhi _bElsevier _c2013 |
||
300 |
_a872p. ; _bSoft Bound _c18.3*24 cm |
||
505 | _a 1 Introduction 2 Modelling I Synchronous Network Model 3 Leader Election in a Synchronous Ring 4 Algorithms in General Synchronous Networks 5 Distributed Consensus with Link Failures 6 Distributed Consensus with Process Failures 7 More Consensus Problems 8 Modelling II: Asynchronous System Model 9 Modelling III: Asynchronous Shared Memory Model 10 Mutual Exclusion 11 Resource Allocation 12 Consensus 13 Atomic Objects 14 Modelling IV: Asynchronous Network Model 15 Basic Asynchronous Network Algorithms 16 Synchronizers 17 Shared Memory versus Networks 18 Logical Time 19 Global Snapshots and Stable Properties 20 Network Resource Allocation 21 Asynchronous Networks with Process Failures 22 Data Link Protocols 23 Partially Synchronous System Models 24 Mutual Exclusion with Partial Synchrony 25 Consensus with Partial Synchrony | ||
942 |
_2ddc _cBK |
||
999 |
_c6504 _d6504 |