Multiprocessor scheduling 2
Upcoming SlideShare
Loading in...5
×
 

Multiprocessor scheduling 2

on

  • 1,691 views

 

Statistics

Views

Total Views
1,691
Slideshare-icon Views on SlideShare
1,691
Embed Views
0

Actions

Likes
1
Downloads
62
Comments
1

0 Embeds 0

No embeds

Accessibility

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel

11 of 1

  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Multiprocessor scheduling 2 Multiprocessor scheduling 2 Presentation Transcript

    • 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
    • ABSTRACT
      • 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.
      •  
      • 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.
    • METHODOLOGY
      • The main objective of the project is to perform scheduling in a multiprocessor system.
      • Generation of a set of synthetic tasks.
      • Fix the number of processors needed for the system.
      • Static Priority assignment to all the tasks using RM policy.
      • Dynamic Priority assignment to all the tasks using EDF policy .
      • The next step is to perform task-processor assignment.
      • The final stage is the scheduling of all the tasks in the multiprocessor system.
    • WHY SCHEDULING ? ? ?
    • APPLICATIONS OF REAL TIME SCHEDULING Patient monitoring Smart environments Mobile devices
    • MULTIPROCESSOR TASK ALLOCATION
      • 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.
      • 1. Static allocation algorithms
        • Utilization balancing algorithm for EDF
        • Next fit algorithm for RM
        • Bin packing algorithm for EDF
      • Disadvantages
      • 1. Does not support in case if new tasks are added to the processors.
      • 2. In case of processor failures it cannot switch tasks.
    • MULTIPROCESSOR TASK ALLOCATION
      • 2. Dynamic allocation algorithms
        • Focused addressing and bidding.
        • Buddy algorithm.
      • Advantages
      • 1. Supports new tasks added to the processors.
      • 2. Accommodates in case of processor failure.
      • NOTE :
      • This algorithms are analyzed to give best results in centralized memory multiprocessors.
    • CENTRALIZED MEMORY MULTIPROCESSOR
    • DISTRIBUTED MEMORY MULTIPROCESSOR
    • STATIC SCHEDULING
      • The best known static scheduling is the Rate monotonic (RM) priority
      • assignment policy.
      • Assign fixed priorities to tasks based on their period, p
      • short period ⇒ higher priority
    • IMPLEMENTATION OF RM ALGORITHM
      • Task resides in sleep queue until released.
      • When released, task is inserted into a FIFO ready queue
      • 3. Separate ready queue for each task
      • 4. Execute the task with highest priority from its ready queue.
    • RATE MONOTONIC SCHEDULING ( RM ALGORITHM)
    •  
    •  
    • RATE MONOTONIC SCHEDULING ( RM ALGORITHM)
    •  
    •  
    • TIME FRAME
      • Literature Review - Aug 2011
      • Synthetic task generation and priority assignment – Sep 2011
      • Implementation of Task-Processor assignment policies – Oct &Nov 2011
      • Scheduling of tasks - Dec 2011
      • Analysis of the results – Jan 2011
      • Hardware implementation– Feb to May 2012
      • Documentation – Jun 2012
    • REFERENCES
      • 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.
      • R. Pellizzoni and G. Lipari Feasibility “Analysis of Real-Time Periodic Tasks with Offsets “Real-Time Systems Journal, 2005.
      • Eric W.Parsons and Kenneth C.Sevcik“Implementing multiprocessor algorithms”.
      • Haobo Yu, Andreas Gerstlauer and Daniel Gajski “RTOS Scheduling in transaction level models”
    • THANK YOU !