Scheduling Games for Concurrent Systems

Kasper Dokter; Sung-Shik Jongmans; Farhad Arbab

doi:10.1007/978-3-319-39519-7_6

Scheduling Games for Concurrent Systems

Kasper Dokter^*, Sung-Shik Jongmans, Farhad Arbab

^*Corresponding author for this work

Research Line Resilience (part of LIRS program)

Research output: Chapter in Book/Report/Conference proceeding › Conference Article in proceeding › Academic › peer-review

Abstract

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.

Original language	English
Title of host publication	Coordination Models and Languages
Subtitle of host publication	18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings
Editors	Alberto Lluch Lafuente, José Proença
Place of Publication	Cham
Publisher	Springer International Publishing
Chapter	6
Pages	84-100
Number of pages	17
ISBN (Electronic)	9783319395197
ISBN (Print)	9783319395180
DOIs	https://doi.org/10.1007/978-3-319-39519-7_6
Publication status	Published - 2016
Event	18th IFIP International Conference on Coordination Models and Languages: Coordination 2016 - Heraklion, Greece Duration: 6 Jun 2016 → 9 Jun 2016 Conference number: 18 http://coordination2016.discotec.org/

Publication series

Series	Lecture Notes in Computer Science (LNCS) series
Volume	9686
ISSN	0302-9743

Series	Programming and Software Engineering LNPSE
Volume	9686

Conference

Conference	18th IFIP International Conference on Coordination Models and Languages
Country/Territory	Greece
City	Heraklion
Period	6/06/16 → 9/06/16
Internet address	http://coordination2016.discotec.org/

Access to Document

10.1007/978-3-319-39519-7_6

Cite this

Dokter, K., Jongmans, S.-S., & Arbab, F. (2016). Scheduling Games for Concurrent Systems. In A. L. Lafuente, & J. Proença (Eds.), Coordination Models and Languages: 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings (pp. 84-100). Springer International Publishing. https://doi.org/10.1007/978-3-319-39519-7_6

Dokter, Kasper ; Jongmans, Sung-Shik ; Arbab, Farhad. / Scheduling Games for Concurrent Systems. Coordination Models and Languages: 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings. editor / Alberto Lluch Lafuente ; José Proença. Cham : Springer International Publishing, 2016. pp. 84-100 (Lecture Notes in Computer Science (LNCS) series, Vol. 9686). (Programming and Software Engineering LNPSE, Vol. 9686).

@inproceedings{08d599a15c5d4216858c5c3a47c8204b,

title = "Scheduling Games for Concurrent Systems",

abstract = "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.",

author = "Kasper Dokter and Sung-Shik Jongmans and Farhad Arbab",

year = "2016",

doi = "10.1007/978-3-319-39519-7_6",

language = "English",

isbn = "9783319395180",

series = "Lecture Notes in Computer Science (LNCS) series",

publisher = "Springer International Publishing",

pages = "84--100",

editor = "Lafuente, {Alberto Lluch} and Proen{\c c}a, {Jos{\'e} }",

booktitle = "Coordination Models and Languages",

address = "Switzerland",

note = "18th IFIP International Conference on Coordination Models and Languages : Coordination 2016 ; Conference date: 06-06-2016 Through 09-06-2016",

url = "http://coordination2016.discotec.org/",

}

Dokter, K, Jongmans, S-S & Arbab, F 2016, Scheduling Games for Concurrent Systems. in AL Lafuente & J Proença (eds), Coordination Models and Languages: 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings. Springer International Publishing, Cham, Lecture Notes in Computer Science (LNCS) series, vol. 9686, Programming and Software Engineering LNPSE, vol. 9686, pp. 84-100, 18th IFIP International Conference on Coordination Models and Languages, Heraklion, Greece, 6/06/16. https://doi.org/10.1007/978-3-319-39519-7_6

Scheduling Games for Concurrent Systems. / Dokter, Kasper; Jongmans, Sung-Shik; Arbab, Farhad.
Coordination Models and Languages: 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings. ed. / Alberto Lluch Lafuente; José Proença. Cham: Springer International Publishing, 2016. p. 84-100 (Lecture Notes in Computer Science (LNCS) series, Vol. 9686). (Programming and Software Engineering LNPSE, Vol. 9686).

Research output: Chapter in Book/Report/Conference proceeding › Conference Article in proceeding › Academic › peer-review

TY - GEN

T1 - Scheduling Games for Concurrent Systems

AU - Dokter, Kasper

AU - Jongmans, Sung-Shik

AU - Arbab, Farhad

N1 - Conference code: 18

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-39519-7_6

DO - 10.1007/978-3-319-39519-7_6

M3 - Conference Article in proceeding

SN - 9783319395180

T3 - Lecture Notes in Computer Science (LNCS) series

SP - 84

EP - 100

BT - Coordination Models and Languages

A2 - Lafuente, Alberto Lluch

A2 - Proença, José

PB - Springer International Publishing

CY - Cham

T2 - 18th IFIP International Conference on Coordination Models and Languages

Y2 - 6 June 2016 through 9 June 2016

ER -

Dokter K, Jongmans SS, Arbab F. Scheduling Games for Concurrent Systems. In Lafuente AL, Proença J, editors, Coordination Models and Languages: 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings. Cham: Springer International Publishing. 2016. p. 84-100. (Lecture Notes in Computer Science (LNCS) series, Vol. 9686). (Programming and Software Engineering LNPSE, Vol. 9686). doi: 10.1007/978-3-319-39519-7_6

Scheduling Games for Concurrent Systems

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this