Quasi-static scheduling of communicating tasks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5201 LNCS, Issue , 2008, Pages 310-324

  Darondeau, Philippe ^a   Genest, Blaise ^a   Thiagarajan, P S ^b   Yang, Shaofa ^a  

^a CAMPUS DE BEAULIEU   (France)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONTROL SYSTEMS; NETWORK PROTOCOLS; REAL TIME SYSTEMS; SENSOR NETWORKS;

BOUNDEDNESS; COMMUNICATING TASKS; COMPUTATIONAL RESOURCES; COMPUTING; CONTROL FLOWS; COVERABILITY; EMBEDDED APPLICATIONS; HARD REAL TIMES; MESSAGE SEQUENCE CHARTS; OPTIMIZING; POINT BUFFERS; RUN TIMES; SCHEDULING DECISIONS; SCHEDULING POLICIES; SEQUENTIAL PROCESSES; STATIC SCHEDULING; TASK MODELS; VIA POINTS;

SCHEDULING;

EID: 54249127374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_26     Document Type: Conference Paper

References (12)

1. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. of the ACM 30(2), 323-342 (1983)
2. Buck, J.: Scheduling dynamic dataflow graphs with bounded memory using the token flow model. PhD Dissertation, Berkeley (1993)
3. Cortadella, J., Kondratyev, A., Lavagno, L., Passerone, C., Watanabe, Y.: Quasistatic scheduling of independent tasks for reactive systems. IEEE Trans. on Comp.-Aided Design 24(10), 1492-1514 (2005)
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)
6. Genest, B., Kuske, D., Muscholl, A.: On communicating automata with bounded channels. Fundamenta Informaticae 80(2), 147-167 (2007)
7. Kahn, G.: The semantics of a simple language for parallel programming. In: Proc. Int. Federation Information Processing (IFIP) Congress, pp. 471-475 (1974)
8. Karp, R., Miller, R.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147-195 (1969)
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)
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)
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)
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)