Описание
Cooperative Task-Oriented Computing. Algorithms and Complexity
Артикул Маркета
5958376836
Внешний вид товаров и/или упаковки может быть изменён изготовителем и отличаться от изображенных на Яндекс Маркете.
Пэй
3 054 ₽
–45%
Пэй
3 054 ₽
–45%
Доставка Маркета
19 окт, по клику 0 ₽
Москва
19 окт, пункт выдачи 0 ₽
Москва
Быстрый возврат
О возвратах
Т8 Издательские Технологии
Магазин
19.2Kзаказов
625подписчиков
6лет на Маркете
О товаре
Описание
Печатная книга «Cooperative Task-Oriented Computing. Algorithms and Complexity» в мягкой обложке, язык - английский. В книге 168 страниц, она напечатана на белой офсетной бумаге плотностью 80 г/м². Формат издания — 191x235 мм. Все книги аккуратно упаковываем в прочный трёхслойный непрозрачный картонный конверт.
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 cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results.
Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings / Bibliography / Authors' Biographies
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 cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results.
Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings / Bibliography / Authors' Biographies
Характеристики
Артикул Маркета
5958376836
Внешний вид товаров и/или упаковки может быть изменён изготовителем и отличаться от изображенных на Яндекс Маркете.Возрастное ограничение 18+
Нет отзывов и оценок
Но можно задать вопрос, чтобы узнать о товаре больше
Рекомендуем
Цена с картой Яндекс Пэй 1152 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 1742 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 1565 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 1938 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 516 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 283 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 2381 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 1082 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 1474 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 482 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 610 ₽ вместо
Пэй
Цена с картой Яндекс Пэй 1707 ₽ вместо
Пэй
Войдите в аккаунтИ тогда откроется корзина, а цены на Маркете могут стать ниже
