Load balancing in the L/sub p/ norm

Uncoordinated Load Balancing and Congestion Games in P2P Systems

“…A peer matching is a (many to one) mapping M : U → V that assigns each user to a host. 1 That is, each user is matched to exactly one host, but a host can be matched to multiple users (or none).…”

“…The matching cost turns out to be related to the sum of the squares of the server loads. Thus, our techniques also lead to improved bounds for a natural online greedy scheme for load balancing [1]. In this short paper, we give a brief overview of some of our key results, so that we can formulate the research problems we wish to propose; full papers describing our mathematical results are in preparation [5,13].…”

“…If all servers have equal speed, then the ratio improves to 2 + √ 5 ≈ 4.24. These results imply improved bounds on the competitive ratio of the (coordinated) greedy solution for L 2 norm server load balancing [1].…”

“…Our peer matching problem has connections with the load balancing variant in which we wish to minimize the L 2 norm of the server loads. The best known result on this problem is by Awerbuch et al [1], who show that the online greedy algorithm achieves a constant factor competitive ratio. Using our techniques, we are able obtain an improved upper bound for the greedy's performance.…”

The hierarchical model for load balancing on two machines

“…The load of a machine i is the sum of the processing times on machine i of jobs assigned to this machine. The typical goal is to minimize the maximum load of any machine but other goals such as maximizing the minimum load of any machine [5,3] and minimizing the p norm of the load vector [2] were studied as well.…”