Excerpt from Optimal Distributed Resource Allocation
In this paper we consider a resource allocation problem in a distributed network, where processors' Speeds can vary dynamically. The problem is local in the sense that the maximum number of users competing for a particular resource at any time instant is upper bounded by a constant v and also at any time instant the maximum number of resources that a user is willing to get is upper bounded by a constant k. Each user's demands for resources may change dynamically.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
EUR 9,90 per la spedizione da Germania a Italia
Destinazione, tempi e costiEUR 1,93 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332173471
Quantità: 15 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332173471
Quantità: 15 disponibili
Da: Buchpark, Trebbin, Germania
Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Codice articolo 26068394/2
Quantità: 1 disponibili
Da: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. Print on Demand. This book solves an issue in distributed computing, a rapidly growing field that underpins modern technology. The problem is that multiple requests for the same resource must be managed to avoid data loss or wasted time. The author presents a series of algorithms that improve upon previous attempts at resource management in a distributed system, making them much faster and more efficient. The book presents two main algorithms, the first being generally efficient for all use cases and the second being faster in certain situations. Both algorithms guarantee that no process will starve or be unfairly treated. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Codice articolo 9781332173471_0
Quantità: Più di 20 disponibili