Advertisement
Published in:
2006 | OriginalPaper | Chapter
Two-Dimensional Priority Scheduling Scheme for Open Real-Time Systems
Authors : Pengliu Tan, Hai Jin, Minghu Zhang
Published in: Computational Science and Its Applications - ICCSA 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper focuses on the scheduling of the tasks with hard, soft and non-real-time timing constraints in open real-time systems. It describes a
Two-Dimensional Priority Scheduling
(TDPS) scheme which not only sets task priority, but also specifies scheduling policy priority. The execution order of a task is determined by both the task priority and its scheduling policy priority. TDPS also supports separating the scheduling mechanism from the scheduling policy. We also enhance TDPS scheme by introducing the CPU utilization bound to each scheduling policy to simplify the schedulability analysis. TDPS scheme can be used to implement different real time systems with different goals (such as hard, soft or hybrid real-time systems) by adjusting the CPU utilization bound of every scheduling policy in runtime. The paper shows through evaluation that TDPS is more open and efficient than the past open real-time scheduling schemes.