A distributed resource allocation algorithm for many processes
نویسندگان
چکیده
منابع مشابه
A Distributed Algorithm for Resource Allocation with Probabilistic Quorum Systems
The resource allocation problem is one of fundamental problems in distributed systems, and many resource models and resource allocation algorithms have been proposed in many literature. In this paper, we consider a problem of allocating a set of unnamed resources that can be overbooked. Such a resource model is suitable for sharing broadband communication channel by many nodes. We propose a ran...
متن کاملAn Algorithm for Resource Allocation through the Classification of DMUs
Data envelopment analysis (DEA) is a non-parametric method for assessing relative efficiency of decision-making units (DMUs). Every single decision-maker with the use of inputs produces outputs. These decision-making units will be defined by the production possibility set. Resource allocation to DMUs is one of the concerns of managers since managers can employ the results of this process to a...
متن کاملA Distributed Resource Allocation Algorithm Using Fuzzy Logic
By considering a distributed system composed of a set of servers, clients, and resources, which characterize environments such as Grids or Clouds, we propose a distributed algorithm for resource allocation. It exploits fuzzy logic whenever a server, which cannot locally satisfy a client resource allocation request, needs to decide to which remote server the request should be forwarded. Furtherm...
متن کاملLocal Coteries and a Distributed Resource Allocation Algorithm
In this paper, we discuss a resource allocation problem in distributed systems. Consider a distributed system consisting of a set of processes and a set of resources of identical type. Each process has access to a (sub)set of the resources. Different processes may have access to different sets of the resources. Each resource must be accessed in a mutually exclusive manner, and processes are all...
متن کاملA New Distributed Resource-Allocation Algorithm with Optimal Failure Locality
Failure locality measures an algorithm’s robustness to process failures. We present a new algorithm for the dining philosophers problem — a classic problem in distributed resource allocation — that has optimal failure locality. As a refinement, the algorithm can be easily parameterized by a simple failure model to achieve super-optimal failure locality in the average case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2013
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-013-0181-7