Scheduling(operating Systems) Algorithms

Scheduling(operating Systems) Algorithms :  :

Scheduling is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance and share system resources effectively or achieve a target quality of service. The need for a scheduling algorithm arises from the requirement for most modern systems to perform multitasking (executing more than one process at a time) and multiplexing (transmit multiple data streams simultaneously across a single physical channel).

The scheduler is concerned mainly with:

·         Throughput 

·         Latency:

·         Turnaround time 

·         Response time 

·         Fairness - Equal CPU time to each process (or more generally appropriate times according to each process' priority and workload).

·         Waiting Time - The time the process remains in the ready queue.

·        Shortest remaining time Similar to Shortest­ Job­ first (SJF)·        Fixed priority pre-emptive scheduling·        Round-robin scheduling

Click here for algorithms:-

·  

·         SHORTEST JOB FIRST SCHEDULING(SJF) PROGRAM IN C

·         PRIORITY SCHEDULING PROGRAM IN C

           Round Robin Scheduling in C Programming(arrival time)

·         Round Robin Scheduling in C Programming(without arrival time)