On-line load balancing made simple: Greedy strikes back
نویسندگان
چکیده
منابع مشابه
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to derive online distributed algorithms whose competitive ratio is characterized by some combinatorial properties of the underlying graph representing the problem. The effectiveness of our approach is shown by the hiera...
متن کاملOn-line Load Balancing
The setup for our problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a diierent level of service, and once assigned can not be reassigned. We make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each ...
متن کاملOn Simple Algorithms for Dynamic Load Balancing
This paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which...
متن کاملGreedy Sharing: Load Balancing on Weakly Consistent Memory
An efficient online scheduler is crucial for balancing irregular parallel computations in a multiprocessor system. Over the last two decades, variants of the work-stealing scheduler have emerged as a popular choice for hardware shared-memory systems. The state-of-the-art work-stealing algorithms can guarantee near-optimal asymptotic complexity by relying on simple yet powerful techniques to bal...
متن کاملHidden Hops Aware Load Balancing Based on Greedy Approach
Virtual network mapping is one of the main problems in network virtualization. At present, virtual networking mapping aims at minimal resource consumption at substrate network, but ignores the resource demanded by the hidden hops, making bottlenecks due to the resource shortage at the hidden hops. This paper aims at the simultaneous loading balance of the substrate node and the substrate link, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.02.001