Real-Time Scheduling with Task Splitting on Multiprocessors

Download Now
Provided by: Keio University
Topic: Hardware
Format: PDF
In this paper, the authors present 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. They 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.
Download Now

Find By Topic