| 書目名稱 | Cooperative Task-Oriented Computing | | 副標(biāo)題 | Algorithms and Compl | | 編輯 | Chryssis Georgiou,Alexander A. Shvartsman | | 視頻video | http://file.papertrans.cn/239/238015/238015.mp4 | | 叢書名稱 | Synthesis Lectures on Distributed Computing Theory | | 圖書封面 |  | | 描述 | Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of | | 出版日期 | Book 2011 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-02005-6 | | isbn_softcover | 978-3-031-00877-1 | | isbn_ebook | 978-3-031-02005-6Series ISSN 2155-1626 Series E-ISSN 2155-1634 | | issn_series | 2155-1626 | | copyright | Springer Nature Switzerland AG 2011 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 02:07
發(fā)表于 2025-3-21 19:12:34
