Professional Documents
Culture Documents
Lec 13OS
Lec 13OS
Lec 13OS
3. IPC : Easy but a lot of overhead, suitable for sharing small volumes of data
4. Flooding of processes
SCHEDULING on SYNCHRONIZATION
MULTIPROCESSORS PRIMITIVES
Multiprocessor Scheduling
Multiprocessor Scheduling (Homogenous)
1. Symmetric vs Unsymmetric
2. Symmetric: How many ready queues?
Heterogeneous Multiprocessor Scheduling (DAG, NP-hard)
Real Time Scheduling : Not fair
1. Meet task deadlines, instead of throughput, waiting time and response time, etc.
2. If you have five homework assignments and only one is due in half an hour, you work
on that one first. Don’t try to be fair to all.
Rocket-control task
The track correction task starts 2000 milliseconds after the launch of the rocket, and
recurs periodically every 50 milliseconds then on. Each instance of the task requires a
processing time of 8 milliseconds and its relative deadline is 50 milliseconds.
Rate Monotonic Scheduling
The Critical Section
1. Mutual Exclusion
2. Progress (don’t write a program with fixed access time for different processes)
3. Bounded Waiting (No starvation)
References
1. https://people.cs.rutgers.edu/~pxk/416/notes/07-scheduling.html