Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm

Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics in Computer Science Springer Journals

Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm

Download PDF
27 pages

Loading next page...
 
/lp/springer-journals/processor-bounding-for-an-efficient-non-preemptive-task-scheduling-CD26zKWa0Z

References (33)

Publisher
Springer Journals
Copyright
Copyright © 2019 by Springer Nature Switzerland AG
Subject
Mathematics; Mathematics, general; Computer Science, general
ISSN
1661-8270
eISSN
1661-8289
DOI
10.1007/s11786-019-00395-7
Publisher site
See Article on Publisher Site

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.

Journal

Mathematics in Computer Science – Springer Journals

Published: May 21, 2019

There are no references for this article.