Name
Abstract | ||
|---|---|---|
This paper proposes a new approach to the well-known Liu–Layland periodic scheduling problem. This approach proves that any just-in-time sequence with maximum absolute deviation being less than one is in fact a periodic schedule. Consequently, periodic schedules can be obtained by any algorithm capable of generating just-in-time sequences with maximum absolute deviation being less than one, for instance, any algorithm minimizing maximum deviation or the quota methods of apportionment. |
Year | DOI | Venue |
|---|---|---|
2005 | https://doi.org/10.1007/s10951-005-1638-5 | Journal of Scheduling |
Keywords | Field | DocType |
just-in-time sequencing,periodic scheduling,the Liu–Layland problem,hard real-time systems,apportionment problem | Bottleneck,Periodic scheduling,Mathematical optimization,Computer science,Absolute deviation,Real-time computing,Schedule,Periodic graph (geometry),Apportionment | Journal |
Volume | Issue | ISSN |
8 | 4 | 1094-6136 |
Citations | PageRank | References |
1 | 0.42 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wieslaw Kubiak | 1 | 540 | 62.61 |