Non-cooperative scheduling of multiple bag-of-task applications - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2006

Non-cooperative scheduling of multiple bag-of-task applications

(1) , (2)
1
2

Abstract

Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of $K$ non-cooperative schedulers using the optimal strategy that maximize their efficiency. Meanwhile fairness is ensured at a system level ignoring applications characteristics. We limit our study to simple single-level master-worker platforms and the case where applications consist of a large number of independent tasks. The tasks of a given application all have the same computation and communication requirements, but these requirements can vary from one application to another. Therefore, each scheduler aims at maximizing its throughput. We give closed-form formula of the equilibrium reached by such a system and study its performances. We characterize the situations where this Nash equilibrium is Pareto-optimal and show that even though no catastrophic situation (Braess-like paradox) can occur, such an equilibrium can be arbitrarily bad for any classical performance measure.
Fichier principal
Vignette du fichier
RR-5819.pdf (667.01 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070206 , version 1 (19-05-2006)
inria-00070206 , version 2 (13-09-2006)

Identifiers

  • HAL Id : inria-00070206 , version 2

Cite

Arnaud Legrand, Corinne Touati. Non-cooperative scheduling of multiple bag-of-task applications. [Research Report] RR-5819, INRIA. 2006, pp.31. ⟨inria-00070206v2⟩
120 View
242 Download

Share

Gmail Facebook Twitter LinkedIn More