Multilevel static real-time scheduling algorithms using graph partitioning
From MaRDI portal
Recommendations
Cited in
(6)- Graph approach to job assignment in distributed real-time systems
- Local planning of multiparty interactions with bounded horizons
- scientific article; zbMATH DE number 820114 (Why is no real title available?)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Scheduling and priority mapping for static real-time milddleware
- Stretching algorithm for global scheduling of real-time DAG tasks
This page was built for publication: Multilevel static real-time scheduling algorithms using graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709518)