Quasi-Static Scheduling of Communicating Tasks
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  as well as the existential boundedness notion of languages of message sequence charts .
KeywordsTask System Static Schedule Outgoing Transition Regular Schedule Message Sequence Chart
Unable to display preview. Download preview PDF.
- 2.Buck, J.: Scheduling dynamic dataflow graphs with bounded memory using the token flow model. PhD Dissertation, Berkeley (1993)Google Scholar
- 4.Darondeau, P., Genest, B., Thiagarajan, P.S., Yang, S.: Quasi-static scheduling of communicating tasks. Technical report, http://www.crans.org/~genest/DGTY08.pdf
- 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
- 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
- 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
- 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.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