Insensitive Job Assignment With Throughput and Energy Criteria for Processor-Sharing Server Farms
Zvi Rosberg, Yu Peng, Jing Fu, Jun Guo, Eric WM Wong, Moshe Zukerman
IEEE-ACM TRANSACTIONS ON NETWORKING | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | Published : 2014
We study the problem of stochastic job assignment in a server farm comprising multiple processor-sharing servers with various speeds and finite buffer sizes. We consider two types of assignment policies: without jockeying, where an arriving job is assigned only once to an available server, and with jockeying, where a job may be reassigned at any time. We also require that the underlying Markov process under each policy is insensitive. Namely, the stationary distribution of the number of jobs in the system is independent of the job size distribution except for its mean. For the case without jockeying, we derive two insensitive heuristic policies: One aims at maximizing job throughput, and the..View full abstract
Awarded by City University of Hong Kong
This work was supported by the City University of Hong Kong under Projects No. 9041794 and No. 9380044.