As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty

  • Jean-François Kempf
  • Marius Bozga
  • Oded Maler
Conference paper

DOI: 10.1007/978-3-642-36742-7_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7795)
Cite this paper as:
Kempf JF., Bozga M., Maler O. (2013) As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty. In: Piterman N., Smolka S.A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2013. Lecture Notes in Computer Science, vol 7795. Springer, Berlin, Heidelberg

Abstract

In this paper we continue our investigation of stochastic (and hence dynamic) variants of classical scheduling problems. Such problems can be modeled as duration probabilistic automata (DPA), a well-structured class of acyclic timed automata where temporal uncertainty is interpreted as a bounded uniform distribution of task durations [18]. In [12] we have developed a framework for computing the expected performance of a given scheduling policy. In the present paper we move from analysis to controller synthesis and develop a dynamic-programming style procedure for automatically synthesizing (or approximating) expected time optimal schedulers, using an iterative computation of a stochastic time-to-go function over the state and clock space of the automaton.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jean-François Kempf
    • 1
  • Marius Bozga
    • 1
  • Oded Maler
    • 1
  1. 1.CNRS-VERIMAGUniversity of GrenobleFrance

Personalised recommendations