17documents trouvés
Steady-state approximations of dynamic speed-scaling in data centers
B.PRABHU, A.E.TUGUI, I.M.VERLOOP
SARA, MTA, IRIT-ENSEEIHT
Manifestation avec acte : International Conference on NETwork Games, COntrol and OPtimization ( NETGCOOP ) 2012 du 28 novembre au 30 novembre 2012, Avignon (France), Novembre 2012, 4p. , N° 12616
Diffusable
128951Worst-case analysis of non-cooperative load balancing
O.BRUN, B.PRABHU
SARA
Rapport Local N°12590, Novembre 2012, 44p.
Lien : http://hal.archives-ouvertes.fr/hal-00747244
Diffusable
Plus d'informations
Abstract
We investigate the impact of heterogeneity in the amount of incoming traffic routed by dispatchers in a non-cooperative load balancing game. For a fixed amount of total incoming traffic, we give sufficient conditions on the cost function under which the worst-case social cost occurs when each dispatcher routes the same amount of traffic, that is, the game is symmetric. We then analyze the symmetric game and derive an explicit expression for the equilibrium flows. We also obtain lower bounds on the Price of Anarchy for (i) cost functions that are polynomial on server loads; and (ii) cost functions representing the mean delay of the Shortest Remaining Processing Time (SRPT) service discipline.
Strictly periodic scheduling in IMA-based architectures
A.AL SHEIKH, O.BRUN, P.E.HLADIK, B.PRABHU
SARA, VERTICS
Revue Scientifique : Real Time Systems, Vol.48, N°4, pp.359-386, Juillet 2012 , N° 12152
Diffusable
127178Price of anarchy in non-cooperative load balancing games
U.AYESTA, O.BRUN, B.PRABHU
MRS
Revue Scientifique : Performance Evaluation, Vol.68, N°12, pp.1312-1332, Décembre 2011 , N° 10051
Diffusable
126502Analysis of an M/G/1 queue with customer impatience and adaptive arrival process
O.BOXMA, B.PRABHU
Eindhoven, MRS
Manifestation avec acte : International conference on NETwork Games, COntrol and OPtimization (NetGCOOP 2011), Paris (France), 12-14 Octobre 2011, 4p. , N° 11603
Lien : http://hal.inria.fr/hal-00644866/fr/
Diffusable
Plus d'informations
Abstract
We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is accepted or rejected. We analyse two different models for impatience : (i) based on workload, and (ii) based on queue-length. For the workload-based model, we obtain the Laplace-Stieltjes Transform of the joint stationary workload and arrival rate process, and that of the waiting time. For the queue-length based model we obtain the analogous z-transform. These queueing models might also be useful for capturing the interaction between congestion control algorithms and queue management schemes in the Internet.
Strictly periodic scheduling on an IMA-based avionic platform
A.AL SHEIKH, O.BRUN, P.E.HLADIK, B.PRABHU
MRS, OLC
Manifestation avec acte : Austrian French German Conference on Optimization (AFG 2011), Toulouse (France), 19-23 Septembre 2011, 3p. , N° 11680
Diffusable
126045A best-response algorithm for multiprocessor periodic scheduling
A.AL SHEIKH, O.BRUN, P.E.HLADIK, B.PRABHU
MRS, OLC
Manifestation avec acte : Euromicro Conference on Real-Time Systems (ECRTS 2011), Porto (Portugal), 5-8 Juillet 2011, pp.228-237 , N° 11055
Diffusable
125071Spatio-temporal control for dynamic routing games
M.K.HANAWAL, E.ALTMAN, R.EL-AZOUZI, B.PRABHU
INRIA Sophia, LIA Avignon, MRS
Manifestation avec acte : International ICST Conference on game Theory for Networks (GameNets 2011) , Shanghai (Chine), 16-18 Avril 2011, 16p. , N° 11358
Diffusable
124920A best-response algorithm for periodic scheduling
A.AL SHEIKH, O.BRUN, P.E.HLADIK, B.PRABHU
MRS, OLC
Rapport LAAS N°11107, Mars 2011, 16p.
Diffusable
124137Performance analysis of traffic surges in multi-class communication networks
M.T.S.JONCKHEERE, R.NUNEZ-QUEIJA, B.PRABHU
Eindhoven, CWI, Amsterdam, MRS
Manifestation avec acte : International Teletraffic Congress (ITC-22), Amsterdam (Pays Bas), 7-9 Septembre 2010, 8p. , N° 10424
Diffusable
123559