Apportionment methods and the Liu–Layland problem |
| |
| Authors: | Joanna Józefowska Łukasz Józefowski Wiesław Kubiak |
| |
| Institution: | 1. Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland;2. Faculty of Business Administration, Memorial University, St. John’s, Canada |
| |
| Abstract: | The Liu–Layland periodic scheduling problem can be solved by the house monotone quota methods of apportionment. This paper shows that staying within the quota is necessary for any apportionment divisor method to solve this problem. As a consequence no divisor method, or equivalently no population monotone method, solves the Liu–Layland problem. |
| |
| Keywords: | Scheduling Just-in-time scheduling Apportionment theory Divisor methods Hard real-time systems |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
