On Scheduling Policies for Streams of Structured Jobs

  • Aldric Degorre
  • Oded Maler
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5215)


We study a class of scheduling problems which combines the structural aspects associated with task dependencies, with the dynamic aspects associated with ongoing streams of requests that arrive during execution. For this class of problems we develop a scheduling policy which can guarantee bounded accumulation of backlog for all admissible request streams. We show, nevertheless, that no such policy can guarantee bounded latency for all admissible request patterns, unless they admit some laxity.


Schedule Problem Schedule Policy Precedence Constraint Resource Type Initial Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Altisen, K., Gößler, G., Pnueli, A., Sifakis, J., Tripakis, S., Yovine, S.: A framework for scheduler synthesis. In: IEEE Real-Time Systems Symposium, pp. 154–163 (1999)Google Scholar
  2. 2.
    Alur, R., Dill, D.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Alur, R., Henzinger, T.: Logics and models of real time: A survey. In: REX Workshop, pp. 74–106 (1991)Google Scholar
  4. 4.
    Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. J. ACM 49(2), 172–206 (2002)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Asarin, E., Maler, O., Pnueli, A.: Symbolic controller synthesis for discrete and timed systems. In: Hybrid Systems II, pp. 1–20 (1994)Google Scholar
  6. 6.
    Blazewicz, J., Ecker, K.H., Pesch, E., Schmidth, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes, 2nd edn. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  7. 7.
    Bodin, L., Golden, B., Assad, A., Ball, M.: Routing and scheduling of vehicles and crews: The state of the art. Computers & OR 10(2), 63–211 (1983)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM 48(1), 13–38 (2001)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Bottazzo, G.: Hard Real-Time Computing Systems: Predictable Schedulding Algorithms and Applications, 2nd edn. Real-Time Systems Series. Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Caccamo, M., Baker, T., Burns, A., Buttazzo, G., Sha, L.: Real-time scheduling for embedded systems. In: Hristu-Varsakelis, D., Levine, W. (eds.) Handbook of Networked and Embedded Control Systems, pp. 173–196. Birkhäuser, Basel (2005)CrossRefGoogle Scholar
  11. 11.
    Cassez, F., David, A., Fleury, E., Larsen, K., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66–80. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Cholvi, V., Echagüe, J.: Stability of fifo networks under adversarial models: State of the art. Computer Networks 51(15), 4460–4474 (2007)CrossRefGoogle Scholar
  13. 13.
    Darte, A., Robert, Y., Vivien, F.: Scheduling and Automatic Parallelization. Birkhauser, Boston (2000)zbMATHGoogle Scholar
  14. 14.
    El-Rewini, H.: Partitioning and scheduling. In: Zomaya, A. (ed.) Parallel & Distributed Computed Handbook, ch. 9, pp. 239–273. McGraw-Hill, New York (1996)Google Scholar
  15. 15.
    Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: Schedulability analysis of fixed-priority systems using timed automata. Theor. Comput. Sci. 354(2), 301–317 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Gan, C.-H., Lin, P., Perng, N.-C., Kuo, T.-W., Hsu, C.-C.: Scheduling for time-division based shared channel allocation for UMTS. Wirel. Netw. 13(2), 189–202 (2007)CrossRefGoogle Scholar
  17. 17.
    Hsu, G.-H.: A survey of queueing theory. Ann. Oper. Res. 24(1-4), 29–43 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Jain, A., Meeran, S.: A state-of-the-art review of job-shop scheduling techniques (1998)Google Scholar
  19. 19.
    Coffman Jr., E.G. (ed.): Computer and Job-Shop Scheduling Theory. J. Wiley, New York (1976)zbMATHGoogle Scholar
  20. 20.
    Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems (an extended abstract). In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229–242. Springer, Heidelberg (1995)Google Scholar
  22. 22.
    Pinedo, M.: Planning and Scheduling in Manufacturing and Services. Springer Series in Operations Research and Financial Engineering. Springer, Heidelberg (2007)Google Scholar
  23. 23.
    Wong-Toi, H., Dill, D.: Synthesizing processes and schedulers from temporal specifications. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 272–281. Springer, Heidelberg (1991)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Aldric Degorre
    • 1
  • Oded Maler
    • 1
  1. 1.Verimag-UJF-CNRSGièresFrance

Personalised recommendations