Rate-monotonic scheduling
flowchart AA["Associated Authors (0)"] C[Rate-monotonic scheduling] BC["Broader Concepts (2)"] NC["Narrower Concepts (16)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q238879
- OpenAlex ID
- https://openalex.org/C127456818 (API record)
- OpenAlex Description
- None
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Deadline-monotonic scheduling
- Earliest deadline first scheduling
- Fixed-priority pre-emptive scheduling
- Gang scheduling
- Generalized processor sharing
- Genetic algorithm scheduling
- Instruction scheduling
- Least slack time scheduling
- Lottery scheduling
- Multiprocessor scheduling
- Nurse scheduling problem
- Open-shop scheduling
- Priority ceiling protocol
- Priority inheritance
- Priority inversion
- Proportionally fair
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.