Name
Abstract | ||
|---|---|---|
The scheduling problem, which is the core of all approaches related to real-time systems, has received proper attention from the research community. However, while preemptive scheduling has benefited from most of the results to date, the more difficult case of non-preemptive scheduling is still lacking similar achievements. This paper is approaching non-preemptive scheduling from two different angles. First, the number of processors that would allow a feasible schedule for a given task set is analyzed, yielding both lower and upper limits which can be determined in polynomial time. Second, a hybrid scheduling algorithm, combining two widely known techniques, namely EDF and LLF, is proposed and tested. A common feature of both objectives is the transition from a single-instance task to a periodic task. The relationships between these two cases are investigated, resulting in a better understanding of periodic behavior. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11786-019-00395-7 | Mathematics in Computer Science |
Keywords | DocType | Volume |
Non-preemptive scheduling, Multiprocessor scheduling, Lower and upper bounds of processors’ number, 68W06 | Journal | 13 |
Issue | ISSN | Citations |
4 | 1661-8270 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ştefan Andrei | 1 | 29 | 5.38 |
| Albert M. K. Cheng | 2 | 307 | 39.69 |
| Vlad Radulescu | 3 | 19 | 3.79 |