Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Rate-Monotonic Scheduling on Uniform Multiprocessors
IEEE Transactions on Computers
An Analysis of EDF Schedulability on a Multiprocessor
IEEE Transactions on Parallel and Distributed Systems
Multiprocessor Scheduling with Few Preemptions
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Real-Time Scheduling with Task Splitting on Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
| Hi-index | 0.00 |
The problem of scheduling simply periodic task systems upon a uniform multiprocessor is considered. Each processor in a uniform multiprocessor is characterized by the speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s x t) units of execution. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is assigned to a specific processor and all jobs generated by a task are required to execute upon the same processor to which the task is assigned. However, the partitioning of periodic task systems requires solving the bin-packing problem, which is known to be intractable (NP-hard in the strong sense). This paper presents a global scheduling algorithm which transforms a given simply periodic task system into another using a "task-splitting" technique. Each transformed simply periodic task system is guaranteed to be successfully scheduled upon any uniform multiprocessor using a partitioned scheduling algorithm. The rate-monotonic (RM) algorithm is chosen for scheduling tasks on each processor. It is proven that the proposed algorithm achieves the theoretical maximum utilization bound upon any uniform multiprocessor platform. Therefore, the proposed algorithm is optimal in the sense of maximizing achievable utilization for simply periodic task system on uniform multiprocessors.