Integrating Job Parallelism in Real-Time Scheduling Theory

Details Integrating Job Parallelism in Real-Time Scheduling Theory Integrating Job Parallelism in Real-Time Scheduling Theory

2008-05-21

arxiv.org/abs/0805.3237v1

Computer Science

Operating Systems

Scientific paper

We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem of these systems is linear relatively to the number of (sporadic) tasks for a fixed number of processors. We propose a scheduling algorithm theoretically optimal (i.e., preemptions and migrations neglected). Moreover, we provide an exact feasibility utilization bound. Lastly, we propose a technique to limit the number of migrations and preemptions.

Affiliated with

Also associated with

No associations

Rating

Integrating Job Parallelism in Real-Time Scheduling Theory 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 Integrating Job Parallelism in Real-Time Scheduling Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integrating Job Parallelism in Real-Time Scheduling Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290019