Optimal Distributed Resource Allocation (Classic Reprint) - Tapa blanda

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.