Feasible processor allocation in a Hard-Real-Time environment |
| |
Authors: | Richard K J Henn |
| |
Affiliation: | (1) GPP Gesellschaft für Prozessrechnerprogrammierung mbH Kolpingring 18a, 8024 Oberhaching, West Germany |
| |
Abstract: | Consider the problem of scheduling a set of preemptible tasks in one or more processor systems. The task system consists of
a set of independent tasks or a task set with precedence relations. Each task is characterized by execution time and deadline.
This article presents scheduling algorithms that guarantee all time constraints. These algorithms are so easy to implement
that they can be used in real-time operating systems. An overview is given for the different feasible scheduling algorithms
of some task and processor systems. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |