Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

RTS
2006

favoriteEmaildiscussreport

138views more RTS 2006»

An Analysis of Fixed-Priority Schedulability on a Multiprocessor

13 years 4 months ago

An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Download www.cs.fsu.edu

A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single-queue m-server system allows for arbitrary fixed task priorities and arbitrary deadlines. For the special case when deadline equals period and priorities are rate monotonic, any set of tasks with maximum individual task utilization umax is feasible if the total utilization does not exceed m(1 - umax)/2 + umax.

Theodore P. Baker

Real-time Traffic

Arbitrary Fixed Task | RTS 2006 | Sporadic Real-time Tasks | Task Utilization Umax |

claim paper

Related Content

» New Response Time Bounds for Fixed Priority Multiprocessor Scheduling

» Improved priority assignment for global fixed priority preemptive scheduling in multiproce...

» EndtoEnd Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks

» Exploiting Precedence Relations in the Schedulability Analysis of Distributed RealTime Sys...

» FPZL Schedulability Analysis

» Feasibility Intervals for FixedPriority RealTime Scheduling on Uniform Multiprocessors

» Semipartitioned FixedPriority Scheduling on Multiprocessors

» Feasibility analysis under fixed priority scheduling with limited preemptions

» Hierarchical Fixed Priority PreEmptive Scheduling

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2006
Where	RTS
Authors	Theodore P. Baker

Comments (0)