Load Balancing Game (original) (raw)

2019

Abstract

Abstract We consider the processor load balancing game with different processors. Players choose processors of different speeds to run their jobs striving to minimize job's delay, i.e., the job completion time on a chosen machine. The social cost is the maximum delay over all processors. In the general case and the special case of 3 machines, we obtain upper estimates for the price of anarchy (PoA) and demonstrate when they coincide with the exact values. Moreover, sufficient conditions for PoA increase are established under new machine inclusion into the system. And finally, we propose a computing algorithm of the exact PoA value in the three-processor model.

Vladimir Mazalov hasn't uploaded this paper.

Let Vladimir know you want this paper to be uploaded.

Ask for this paper to be uploaded.