| 書目名稱 | Introduction to Reliable Distributed Programming | | 編輯 | Rachid Guerraoui,Luís Rodrigues | | 視頻video | http://file.papertrans.cn/475/474132/474132.mp4 | | 概述 | Introduces fundamental reliable distributed programming abstractions, and offers algorithms to implement these abstractions.Incremental approach explores basic abstractions before moving to more sophi | | 圖書封面 |  | | 描述 | .In modern computing a program is usually distributed among several processes. The fundamental challenge when developing reliable distributed programs is to support the cooperation of processes required to execute a common task, even when some of these processes fail...Guerraoui and Rodrigues present an introductory description of fundamental reliable distributed programming abstractions as well as algorithms to implement these abstractions. The authors follow an incremental approach by first introducing basic abstractions in simple distributed environments, before moving to more sophisticated abstractions and more challenging environments. Each core chapter is devoted to one specific class of abstractions, covering reliable delivery, shared memory, consensus and various forms of agreement. ..This textbook comes with a companion set of running examples implemented in Java. These can be used by students to get a better understanding of how reliable distributed programming abstractions can be implemented and used in practice. Combined, the chapters deliver a full course on reliable distributed programming. The book can also be used as a complete reference on the basic elements requir | | 出版日期 | Textbook 20061st edition | | 關(guān)鍵詞 | Algorithms; Broadcast; Communication Protocols; Distributed Algorithms; Distributed Programming; Java; Rel | | 版次 | 1 | | doi | https://doi.org/10.1007/3-540-28846-5 | | isbn_ebook | 978-3-540-28846-6 | | copyright | Springer-Verlag Berlin Heidelberg 2006 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-2-7 19:58
發(fā)表于 2025-3-21 16:40:33
