Quasi-Static Scheduling of Communicating Tasks

DOI10.1007/978-3-540-85361-9_26MaRDI QIDQ3541026zbMATH OpenOpenAlexFDO

Authors Blaise Genest, P. S. Thiagarajan, Shaofa Yang, Philippe Darondeau

Publication date 25 November 2008

Published in CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85361-9_26

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Quasi-static scheduling of communicating tasks
• Task automata: Schedulability, decidability and undecidability
• Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
• scientific article; zbMATH DE number 1830720
• Scheduling tasks and communications on a virtual distributed system

Cited in

(2)

• Quasi-static scheduling of communicating tasks
• Step coverability algorithms for communicating systems

This page was built for publication: Quasi-Static Scheduling of Communicating Tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541026)