000 03811nam a22005175i 4500
001 978-1-4614-4881-5
003 DE-He213
005 20200421111657.0
007 cr nn 008mamaa
008 120915s2013 xxu| s |||| 0|eng d
020 _a9781461448815
_9978-1-4614-4881-5
024 7 _a10.1007/978-1-4614-4881-5
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM075000
_2bisacsh
082 0 4 _a004.6
_223
100 1 _aShankar, A. Udaya.
_eauthor.
245 1 0 _aDistributed Programming
_h[electronic resource] :
_bTheory and Practice /
_cby A. Udaya Shankar.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2013.
300 _aXVIII, 386 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aIntroduction -- Simple Lock -- Bounded Buffer -- Message-Passing Services -- Fifo Channels from Unreliable Channels -- Programs, Semantics and Effective Atomicity -- Implements and Compositionality -- SESF for Time-Constrained Programs -- Lock using Peterson's Algorithm -- Lock using the Bakery Algorithm -- Distributed Lock Service -- Distributed Lock using Timestamps -- Channel with Termination Detection Service -- Termination Detection for Diffusing Computations -- Object-Transfer Service -- Object Transfer using Path Reversal -- Distributed Shared Memory Service -- A Single-Copy Distributed Shared Memory -- A Multi-Copy Distributed Shared Memory -- Reliable Transport Service -- Reliable Transport Protocol.
520 _aDistributed Programming: Theory and Practice presents a practical and rigorous method to develop distributed programs that correctly implement their specifications. The method also covers how to write specifications and how to use them. Numerous examples such as bounded buffers, distributed locks, message-passing services, and distributed termination detection illustrate the method. Larger examples include data transfer protocols, distributed shared memory, and TCP network sockets. Distributed Programming: Theory and Practice bridges the gap between books that focus on specific concurrent programming languages and books that focus on distributed algorithms.  Programs are written in a "real-life" programming notation, along the lines of Java and Python with explicit instantiation of  threads and programs.  Students and programmers will see these as programs and not "merely" algorithms in pseudo-code.  The programs implement interesting algorithms and solve problems that are large enough to serve as projects in programming classes and software engineering classes. Exercises and examples are included at the end of each chapter with on-line access to the solutions. Distributed Programming: Theory and Practice is designed as an advanced-level text book for students in computer science and electrical engineering.  Programmers, software engineers and researchers working in this field will also find this book useful.
650 0 _aComputer science.
650 0 _aComputer communication systems.
650 0 _aComputer programming.
650 0 _aSoftware engineering.
650 0 _aComputer logic.
650 0 _aComputers.
650 1 4 _aComputer Science.
650 2 4 _aComputer Communication Networks.
650 2 4 _aProgramming Techniques.
650 2 4 _aSoftware Engineering.
650 2 4 _aModels and Principles.
650 2 4 _aLogics and Meanings of Programs.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781461448808
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4614-4881-5
912 _aZDB-2-SCS
942 _cEBK
999 _c54772
_d54772