Your SlideShare is downloading. ×
0
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Multiprocessor scheduling 2
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Multiprocessor scheduling 2

2,031

Published on

Published in: Technology, Education
1 Comment
1 Like
Statistics
Notes
No Downloads
Views
Total Views
2,031
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
104
Comments
1
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. MULTIPROCESSOR SCHEDULING Guided by Ms.ANJU S PILLAI Assistant professor(SG) Department of EEE Submitted by MUTHU KUMAR .B CB.EN.P2EBS10012 Department of EEE
  • 2. ABSTRACT <ul><li>Uniprocessor scheduling is widely used for its simplicity, reliability and ease for implementation. But it has got its limitations over less processor utilization factor. For a better processor utilization and performance multiprocessor scheduling is preferred. </li></ul><ul><li>  </li></ul><ul><li>One of the major challenges is to find an optimal task-processor assignment. The work aims at finding different task processor assignment policies and finding a better Processor Utilization and schedule the tasks dynamically using EDF algorithm. </li></ul>
  • 3. METHODOLOGY <ul><li>The main objective of the project is to perform scheduling in a multiprocessor system. </li></ul><ul><li>Generation of a set of synthetic tasks. </li></ul><ul><li>Fix the number of processors needed for the system. </li></ul><ul><li>Static Priority assignment to all the tasks using RM policy. </li></ul><ul><li>Dynamic Priority assignment to all the tasks using EDF policy . </li></ul><ul><li>The next step is to perform task-processor assignment. </li></ul><ul><li>The final stage is the scheduling of all the tasks in the multiprocessor system. </li></ul>
  • 4. WHY SCHEDULING ? ? ?
  • 5. APPLICATIONS OF REAL TIME SCHEDULING Patient monitoring Smart environments Mobile devices
  • 6. MULTIPROCESSOR TASK ALLOCATION <ul><li>There are different strategies to allocate Tasks to multiprocessors. The allocation will decide which task to be assigned to which processor in an optimal way. </li></ul><ul><li>1. Static allocation algorithms </li></ul><ul><ul><li>Utilization balancing algorithm for EDF </li></ul></ul><ul><ul><li>Next fit algorithm for RM </li></ul></ul><ul><ul><li>Bin packing algorithm for EDF </li></ul></ul><ul><li>Disadvantages </li></ul><ul><li>1. Does not support in case if new tasks are added to the processors. </li></ul><ul><li>2. In case of processor failures it cannot switch tasks. </li></ul>
  • 7. MULTIPROCESSOR TASK ALLOCATION <ul><li>2. Dynamic allocation algorithms </li></ul><ul><ul><li>Focused addressing and bidding. </li></ul></ul><ul><ul><li>Buddy algorithm. </li></ul></ul><ul><li>Advantages </li></ul><ul><li>1. Supports new tasks added to the processors. </li></ul><ul><li>2. Accommodates in case of processor failure. </li></ul><ul><li>NOTE : </li></ul><ul><li>This algorithms are analyzed to give best results in centralized memory multiprocessors. </li></ul>
  • 8. CENTRALIZED MEMORY MULTIPROCESSOR
  • 9. DISTRIBUTED MEMORY MULTIPROCESSOR
  • 10. STATIC SCHEDULING <ul><li>The best known static scheduling is the Rate monotonic (RM) priority </li></ul><ul><li>assignment policy. </li></ul><ul><li>Assign fixed priorities to tasks based on their period, p </li></ul><ul><li>short period ⇒ higher priority </li></ul>
  • 11. IMPLEMENTATION OF RM ALGORITHM <ul><li>Task resides in sleep queue until released. </li></ul><ul><li>When released, task is inserted into a FIFO ready queue </li></ul><ul><li>3. Separate ready queue for each task </li></ul><ul><li>4. Execute the task with highest priority from its ready queue. </li></ul>
  • 12. RATE MONOTONIC SCHEDULING ( RM ALGORITHM)
  • 13.  
  • 14.  
  • 15. RATE MONOTONIC SCHEDULING ( RM ALGORITHM)
  • 16.  
  • 17.  
  • 18. TIME FRAME <ul><li>Literature Review - Aug 2011 </li></ul><ul><li>Synthetic task generation and priority assignment – Sep 2011 </li></ul><ul><li>Implementation of Task-Processor assignment policies – Oct &Nov 2011 </li></ul><ul><li>Scheduling of tasks - Dec 2011 </li></ul><ul><li>Analysis of the results – Jan 2011 </li></ul><ul><li>Hardware implementation– Feb to May 2012 </li></ul><ul><li>Documentation – Jun 2012 </li></ul>
  • 19. REFERENCES <ul><li>P. Ancilotti, G. Buttazzo, M. D. Natale, and M. Spuri. “Design and programming tools for time critical applications.” Real-Time Systems, 14:3, pp. 251–269, May 1998. </li></ul><ul><li>R. Pellizzoni and G. Lipari Feasibility “Analysis of Real-Time Periodic Tasks with Offsets “Real-Time Systems Journal, 2005. </li></ul><ul><li>Eric W.Parsons and Kenneth C.Sevcik“Implementing multiprocessor algorithms”. </li></ul><ul><li>Haobo Yu, Andreas Gerstlauer and Daniel Gajski “RTOS Scheduling in transaction level models” </li></ul>
  • 20. THANK YOU !

×