Scribd
Upload
51 views

Priority Driven Scheduling of Periodic Tasks

The document discusses different scheduling algorithms for periodic real-time tasks, including fixed priority algorithms like Rate Monotonic Algorithm (RMA) and Deadline Monotonic Algorithm (DMA) which assign static priorities, and dynamic priority algorithms like Earliest Deadline First (EDF). It provides schedulability tests for RMA like Liu and Layland's utilization bound and Lehoczky's test, and notes that DMA assigns priorities based on relative deadlines while RMA uses periods.

Uploaded by

Mayank Ahuja
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
51 views

Priority Driven Scheduling of Periodic Tasks

The document discusses different scheduling algorithms for periodic real-time tasks, including fixed priority algorithms like Rate Monotonic Algorithm (RMA) and Deadline Monotonic Algorithm (DMA) which assign static priorities, and dynamic priority algorithms like Earliest Deadline First (EDF). It provides schedulability tests for RMA like Liu and Layland's utilization bound and Lehoczky's test, and notes that DMA assigns priorities based on relative deadlines while RMA uses periods.

Uploaded by

Mayank Ahuja
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

Priority Driven Scheduling of Periodic Tasks

Fixed Priority Algorithms Assign the same priority to all the instances of one task Dynamic Priority Algorithm Assigns the different priorities to the individual task instances.

Fixed Priority Algorithms


Rate Monotonic Algorithm Deadline Monotonic Algorithm

Rate Monotonic Algorithm


Assigns priorities to the tasks according to their periods. Shorter the period, higher the priority.

Schedulability Test
Necessary Condition ei/pi1 Sufficient Condition ei/pin(21/n-1) If a task set passes this test it is guaranteed to be RMA schedulable.On the other hand if it fails the test ,still it may be RMA schedulable

Lehoczky Test
A set of periodic real time tasks are RMA schedulable under any task phasing if all the tasks meet their first deadline under zero task phasing.

Determine whether the following set of tasks pass the Lehoczky Test

Deadline Monotonic Algorithm


Shorter the relative deadline, higher the priority.

Difference Between RMA and EDF


EDF is dynamic . why?

DMA is fixed priority

Deadline Monotonic Algorithm


Shorter the relative deadline, higher the priority.

Difference Between RMA and EDF


EDF is dynamic . why?

DMA is fixed priority

You might also like