Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Load Balancing in Processor Sharing Systems , U. Ayesta2,3
 

Summary: Load Balancing in Processor Sharing Systems
E. Altman1
, U. Ayesta2,3
, B.J. Prabhu2
1
INRIA Sophia Antipolis, France, email: altman@sophia.inria.fr
2
LAAS-CNRS, Universit´e de Toulouse, France. e-mail: {urtzi,bjprabhu}@laas.fr
3
BCAM - Basque Center for Applied Mathematics, Derio, Spain
May 26, 2009
Abstract
We investigate optimal load balancing strategies for a multi-class multi-server processor-sharing system
with a Poisson input stream, heterogeneous service rates, and a server-dependent holding cost per unit
time. Specifically, we study (i) the centralized setting in which a dispatcher routes incoming jobs based on
their service time requirements so as to minimize the weighted mean sojourn time in the system; and (ii)
the decentralized, distributed non-cooperative setting in which each job, aware of its service time, selects a
server with the objective of minimizing its weighted mean sojourn time in the system. For the decentralized
setting we show the existence of a potential function, which allows us to transform the non-cooperative
game into a standard convex optimization problem.

  

Source: Ayesta, Urtzi - Laboratoire d'Analyse et d'Architecture des Systèmes du CNRS

 

Collections: Engineering