Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems

Details Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems

2010-04-12

arxiv.org/abs/1004.2033v1

Computer Science

Data Structures and Algorithms

Scientific paper

We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey.

Affiliated with

Also associated with

No associations

Rating

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems 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 Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263329