Optimal \((D - J)\)-monotonic priority assignment (Q2379982): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019944217 / 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: On the complexity of fixed-priority scheduling of periodic, real-time tasks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On fixed priority scheduling, offsets and co-prime task periods / rank | |||
Normal rank | |||
Latest revision as of 15:24, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal \((D - J)\)-monotonic priority assignment |
scientific article |
Statements
Optimal \((D - J)\)-monotonic priority assignment (English)
0 references
24 March 2010
0 references
real-time systems
0 references
fixed priority scheduling
0 references
priority assignment
0 references
optimality
0 references
