An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor

Details An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor

2011-04-18

arxiv.org/abs/1104.3523v1

Computer Science

Operating Systems

10 pages - rejected for publication by ECRTS 2011

Scientific paper

An optimal solution to the problem of scheduling real-time tasks on a set of identical processors is derived. The described approach is based on solving an equivalent uniprocessor real-time scheduling problem. Although there are other scheduling algorithms that achieve optimality, they usually impose prohibitive preemption costs. Unlike these algorithms, it is observed through simulation that the proposed approach produces no more than three preemptions points per job.

Affiliated with

Also associated with

No associations

Rating

An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72354