Deterministic and Randomized Algorithms for Distributed On-line Task Assignment and Load Balancing without Load Status Information Deterministic and Randomized Algorithms for Distributed On-line Task Assignment and Load Balancing without Load Status Information
نویسنده
چکیده
{ We nd two interesting thresholds for the number of tasks generated under a new model of on-line task assignment and load balancing environment, in which tasks are assigned without any information on current load status, and load balancing is achieved together with task assignment. It is shown that balanced task assignment can be obtained deterministically when the number of tasks exceeds the rst threshold. Otherwise, a simple randomized strategy can achieve balanced load distribution with high probability if the number of tasks exceeds the second threshold.
منابع مشابه
Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملA Performance Study on Load Balancing Algorithms with Task Migration
In this paper, we present a performance study on three diierent load balancing algorithms. The rst algorithm employs only task assignment, whereas the other two allow both task assignment and migration. We conclude that although task migration usually costs more than task assignment, under some situations it can augment task assignment to provide extra performance improvement. This is because t...
متن کاملLoad Balancing Approaches for Web Servers: A Survey of Recent Trends
Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...
متن کاملAnalysing the Impact of Heterogeneity with Greedy Resource Allocation Algorithms for Dynamic Load Balancing in Heterogeneous Distributed Computing System
Heterogeneous Distributed systems have been an active research area in computer science for the last two decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i. e. the completion time at the maximum loaded computing node). This paper presents and discusses ...
متن کاملLoad Balancing in Heterogeneous Distributed Computing Systems using Approximation Algorithm
Approximation algorithms have been used to design polynomial time algorithms for intractable problems that provide solutions within the bounded proximity of the optimal solution. Load balancing problem on Heterogeneous Distributed Computing System (HDCS) deals with allocation of tasks to computing nodes, so that computing nodes are evenly loaded. Load-balancing algorithms are attempts to comput...
متن کامل