Skip to Main content Skip to Navigation

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

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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Arnaud Legrand Connect in order to contact the contributor
Submitted on : Wednesday, September 13, 2006 - 2:05:51 PM
Last modification on : Friday, January 21, 2022 - 3:23:49 AM
Long-term archiving on: : Monday, October 22, 2012 - 11:51:04 AM


  • HAL Id : inria-00070206, version 2



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



Les métriques sont temporairement indisponibles