{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines (Q613790): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Proportionate progress: A notion of fairness in resource allocation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: EDZL scheduling analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4526977 / rank | |||
Normal rank | |||
Latest revision as of 14:52, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines |
scientific article |
Statements
{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines (English)
0 references
22 December 2010
0 references
multiprocessor scheduling
0 references
hard real-time systems
0 references
periodic tasks
0 references
sporadic tasks
0 references
unconstrained deadlines
0 references
0 references
