Quasi-Static Scheduling of Communicating Tasks

  • Philippe Darondeau
  • Blaise Genest
  • P. S. Thiagarajan
  • Shaofa Yang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5201)


Good scheduling policies for distributed embedded applications are required for meeting hard real time constraints and for optimizing the use of computational resources. We study the quasi-static scheduling problem in which (uncontrollable) control flow branchings can influence scheduling decisions at run time. Our abstracted task model consists of a network of sequential processes that communicate via point-to-point buffers. In each round, the task gets activated by a request from the environment. When the task has finished computing the required responses, it reaches a pre-determined configuration and is ready to receive a new request from the environment. For such systems, we prove that determining existence of quasi-static scheduling policies is undecidable. However, we show that the problem is decidable for the important sub-class of “data branching” systems in which control flow branchings are due exclusively to data-dependent internal choices made by the sequential components. This decidability result—which is non-trivial to establish—exploits ideas derived from the Karp and Miller coverability tree [8] as well as the existential boundedness notion of languages of message sequence charts [6].


Task System Static Schedule Outgoing Transition Regular Schedule Message Sequence Chart 
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.
    Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. of the ACM 30(2), 323–342 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Buck, J.: Scheduling dynamic dataflow graphs with bounded memory using the token flow model. PhD Dissertation, Berkeley (1993)Google Scholar
  3. 3.
    Cortadella, J., Kondratyev, A., Lavagno, L., Passerone, C., Watanabe, Y.: Quasi-static scheduling of independent tasks for reactive systems. IEEE Trans. on Comp.-Aided Design 24(10), 1492–1514 (2005)CrossRefGoogle Scholar
  4. 4.
    Darondeau, P., Genest, B., Thiagarajan, P.S., Yang, S.: Quasi-static scheduling of communicating tasks. Technical report,
  5. 5.
    de Frutos-Escrig, D.: Decidability of home states in place transition systems. Internal Report. Dpto. Informatica y Automatica. Univ. Complutense de Madrid (1986)Google Scholar
  6. 6.
    Genest, B., Kuske, D., Muscholl, A.: On communicating automata with bounded channels. Fundamenta Informaticae 80(2), 147–167 (2007)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Kahn, G.: The semantics of a simple language for parallel programming. In: Proc. Int. Federation Information Processing (IFIP) Congress, pp. 471–475 (1974)Google Scholar
  8. 8.
    Karp, R., Miller, R.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Kondratyev, A., Lavagno, L., Passerone, C., Watanabe, Y.: Quasi-static scheduling of concurrent specifications. In: The Embedded Systems Handbook. CRC Press, Boca Raton (2005)Google Scholar
  10. 10.
    Sgroi, M., Lavagno, L., Watanabe, Y., Sangiovanni-Vincentelli, A.: Quasi-static scheduling of embedded software using equal conflict nets. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 208–227. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  11. 11.
    Leue, S., Mayr, R., Wei, W.: A scalable incomplete test for the boundedness of UML RT models. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 327–341. Springer, Heidelberg (2004)Google Scholar
  12. 12.
    Liu, C., Kondratyev, A., Watanabe, Y., Sangiovanni-Vincentelli, A.L., Desel, J.: Schedulability Analysis of Petri Nets Based on Structural Properties. In: ACSD 2006, pp. 69–78 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Philippe Darondeau
    • 1
  • Blaise Genest
    • 1
  • P. S. Thiagarajan
    • 2
  • Shaofa Yang
    • 1
  1. 1.IRISA, CNRS & INRIA, RennesFrance
  2. 2.School of Computing, National University of Singapore 

Personalised recommendations