MULTIPROCESSOR SCHEDULING

Guided by

Ms.ANJU S PILLAIAssistant professor(SG)Department of EEE

Submitted by

MUTHU KUMAR .BCB.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. 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.

MOTIVATION AND EXPECTED RESULTS

Nowadays uniprocessors are not able to satisfy the growing need for processor utilization and performance. So the multiprocessors like i3, i5 and i7 are into markets. Even in multiprocessor systems, the processors are not utilized fully. So, to enhance the processor utilization, the run-time scheduling algorithms are preferred.

The expected result is to have a high processor utilization with optimal task assignment policy and schedule the tasks at run-time.

BLOCK DIAGRAM

P1 P2 Pn

RTOS

MEMORYInput/output

T1 T2 T3 Tn

OUT

IN

TIME FRAME

Literature Review - Aug 2011 Synthetic task generation and priority assignment by EDF – 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 !