Locality-Sensitive Resource Allocation

نویسندگان

  • Baruch Awerbuch
  • David Peleg
چکیده

This paper presents a locality-sensitive controller, governing the supply of demands for a given resource in a way that takes into account the distances between the requesting vertex and the location of resource. The controller has eecient communication complexities for its allocation and update operations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Private Searching on Encrypted Data in Cloud

Cloud computing appeared as the most common paradigm in the time being that provides calculations and storage resources by when used – pay method. Users can exploit cloud resources from anywhere at any time without maintenance cost. Flexibility in resource allocation enabled cloud services to be effective in delivering with reasonable cost. However, transfer data to cloud make it vulnerable to ...

متن کامل

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.

متن کامل

Resource Allocation for a Mobile Application Oriented Architecture

A Montium is a coarse-grained reconfigurable architecture designed by the CADTES group of the University of Twente for mobile applications. This paper presents a resource allocation method to allocate variables to storage places and to schedule data movements for the Montium. The resource allocation method exploits locality of reference of the Montium architecture as well as its parallelism.

متن کامل

Towards Makespan Minimization Task Allocation in Data Centers

Nowadays, data centers suffer from resource limitations in both the limited bandwidth resources on the links and the computing capability on the servers, which triggers a variety of resource management problems. In this paper, we discuss one classic resource allocation problem: task allocation in data centers. That is, given a set of tasks with different makespans, how to schedule these tasks i...

متن کامل

Locality-sensitive task allocation and load balancing in networked multiagent systems: Talent versus centrality

With the development of large scale multiagent systems, agents are always organized in network structures where each agent interacts only with its immediate neighbors in the network. Coordination among networked agents is a critical issue which mainly includes two aspects: task allocation and load balancing; in traditional approach, the resources of agents are crucial to their abilities to get ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990