The competitiveness of on-line assignments
Journal of Algorithms
On-line load balancing of temporary tasks
Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On-line Load Balancing for Related Machines
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
In a hierarchical server environment, jobs must be assigned in an online fashion to a collection of servers forming a hierarchy of capability. Each job requests a specific server meeting its needs but the system is free to assign it either to that server or to any other server higher in the hierarchy. Each job carries a certain load, which it imparts to the server to which it is assigned. The goal is to minimize the maximum total load on a server.We consider the linear hierarchy, where the servers are totally ordered in terms of capability, and the tree hierarchy, where ancestors are more powerful than their descendants. We investigate several variants of the problem, differing from one another by whether jobs are weighted or unweighted; whether they are permanent or temporary; and whether assignments are fractional or integral.We derive upper and lower bounds on the competitive ratio.