We consider an online load balancing problem and its extensions in the framework of repeated games. On each round, player chooses a distribution (task allocation) over K servers, then environment reveals server, which determines computation time server for processing task assigned. After all rounds, cost is measured by some norm cumulative computation-time vector. The makespan if \(L_\infty \)-...

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...

We investigate a semi-online variant of load balancing with restricted assignment. In this problem, we are given n jobs, which need to be processed by m machines the goal minimize maximum machine load. Since strong lower bounds rule out any competitive ratio o(log?n), may reassign jobs at certain job-individual cost. generalize result Gupta, Kumar, and Stein (SODA 2014) giving O(log?log?mn)-com...

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...

In the online load balancing problem on related machines, we have a set of jobs (with different sizes) arriving online, and task is to assign each job machine immediately upon its arrival, so as minimize makespan, i.e., maximum completion time. classic mechanism design problems, assume that are controlled by selfish agents, with sizes being their private information. Each (agent) aims at minimi...

Nowadays, cloud computing has become a key technology for online allotment of computing resources and online storage of user’s data in a lower cost, where computing resources are available all the time, over the internet with pay per use concept. Cloud computing is business oriented concept where computing resources are outsourced by cloud provider to their client, who demand computing online. ...

We consider the problem of online load balancing under lp-norms: sequential jobs need to be assigned to one of the machines and the goal is to minimize the lp-norm of the machine loads. This generalizes the classical problem of scheduling for makespan minimization (case l∞) and has been thoroughly studied. However, despite the recent push for beyond worst-case analyses, no such results are know...

a r t i c l e i n f o a b s t r a c t We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased by this. We...