Summary :- Distributed Process Scheduling . Prepared BY:- JAYA KALIDINDI. Summary of chapter 5. A System performance model Static process scheduling Dynamic load sharing and balancing Distributed process implementation Real time scheduling. A system performance model.
Related searches for Summary :- Distributed Process Scheduling
Directed edges represent the precedence relationship
N- Number of processes
- Efficiency Loss when implemented on a real machine.
RP-relative processing requirement
Speed up depends on:
Design and efficiency of the scheduling algorithm.
Architecture of the system
Depending on how the request messages are interpreted,
there are three main application scenarios:
Can be classified as:
Static vs dynamic
Premptive vs non-premptive
Global vs Local
Deadline Monotonic:-In real time system some tasks need to complete execution a short time after being requested.
Earliest Deadline First:-this is applies dynamic priority scheduling to achieve better CPU utilization .
Real time Synchronization:-A set of tasks that cooperate to achieve a goal will need to share information and resources or other words synchronize with other tasks.
. Randy Chow, Theodore Johnson, “Distributed Operating Systems & Algorithms”, Addison Wesley.(all diagrams)
.Dejan S. Milojicic Fred DouglisYves Paindaveine Richard Wheeler Songnian Zhou, “Process Migration” , ACM Computing Surveys (CSUR) Volume 32 , Issue 3 (September 2000)
. S. Cheng, J.A. Stankovic and K. Ramamritham, ‘‘Scheduling Algorithms for Hard Real-Time Systems: A Brief Survey’’, page6-7 in Hard Real-Time Systems: Tutorial, IEEE (1988).
 .Distributed Process Scheduling. Advanced Operating Systems Louisiana State University Rajgopal Kannan. Issues in Distributed Scheduling.www.csc.lsu.edu/