Real-Time Scheduling with Task Splitting on Multiprocessors

Authors:
Shinpei Kato;Nobuyuki Yamasaki
Affiliations:
Keio University, Yokohama, Japan;Keio University, Yokohama, Japan
Venue:
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2007

Citing 0
Cited 11

Portioned EDF-based scheduling on multiprocessors

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Optimal RM scheduling for simply periodic tasks on uniform multiprocessors

Proceedings of the 2009 International Conference on Hybrid Information Technology
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Implementation and evaluation of global and partitioned scheduling in a real-time OS

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called portioned scheduling that assigns each task to a particular processor like partitioned scheduling but can split a task into two processors if there is not enough capacity remaining on a processor. We describe an algorithm for assigning tasks to processors as well as an algorithm for scheduling the assigned tasks on per-processor. The schedulability analysis provides a formula to calculate the upper bound of the schedulable per-processor utilization for the algorithm. We then prove that the least upper bound of the whole system utilization is 50%. In addition, we propose heuristic procedures to improve schedulability. The simulation results show that the algorithm can often successfully schedule a task set with system utilization much higher than 50%, though the least upper bound is 50%. We also show that the algorithm achieves higher schedulability with fewer preemptions compared to the existiting algorithms.