Scheduling Games for Concurrent Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Scheduling Games for Concurrent Systems


A scheduler is an algorithm that assigns at any time a set of processes to a set of processors. Processes usually interact with each other, which introduces dependencies amongst them. Typically, such dependencies induce extra delays that the scheduler needs to avoid. Specific types of applications, like streaming applications, synthesize a scheduler from a formal model that is aware of these interactions. However, such interaction-specific information is not available for general types of applications. In this paper, we propose an interaction aware scheduling framework for generic concurrent applications. We formalize the amount of work performed by an application as constraints. We use these constraints to generate a graph, and view scheduler synthesis as solving a game on this graph that is played between the scheduler and the application. We illustrate that our framework is expressive enough to subsume an established scheduling framework for streaming programs.
Fichier principal
Vignette du fichier
416253_1_En_6_Chapter.pdf (315.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01631719 , version 1 (09-11-2017)





Kasper Dokter, Sung-Shik Jongmans, Farhad Arbab. Scheduling Games for Concurrent Systems. 18th International Conference on Coordination Languages and Models (COORDINATION), Jun 2016, Heraklion, Greece. pp.84-100, ⟨10.1007/978-3-319-39519-7_6⟩. ⟨hal-01631719⟩
125 View
59 Download



Gmail Facebook X LinkedIn More