Non-Cooperative Scheduling of Multiple Bag-of-Task Applications
Arnaud Legrand (INRIA Rh\^one-Alpes / Id-Imag, Lig), Corinne Touati, (INRIA Rh\^one-Alpes / Id-Imag, Lig)

TL;DR
This paper analyzes how multiple non-cooperative schedulers compete for resources in heterogeneous platforms, deriving equilibrium behaviors and assessing their efficiency and fairness.
Contribution
It provides a closed-form characterization of Nash equilibria in non-cooperative scheduling of bag-of-task applications on master-worker platforms.
Findings
Nash equilibrium formulas for non-cooperative schedulers
Conditions where equilibrium is Pareto optimal
Equilibrium can be arbitrarily inefficient for performance measures
Abstract
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of non-cooperative schedulers using the optimal strategy that maximize their efficiency while fairness is ensured at a system level ignoring applications characteristics. We limit our study to simple single-level master-worker platforms and to the case where each scheduler is in charge of a single application consisting 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. In this context, we assume that each scheduler aims at maximizing its throughput. We give closed-form formula of the equilibrium reached by such a system and study its performance. We characterize the situations where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Distributed systems and fault tolerance · Cloud Computing and Resource Management
