| Abstract |
: |
Round Robin (RR) is a pre-emptive algorithm used in multiprogrammed, conventional systems to schedule all the processes which are present in ready queue for execution. It has some advantages over other algorithms i.e., it gives a chance to all process to utilize processor for equal time interval. But this technique increases average turnaround time, average waiting time and if quantum value is very less, then CPU time is wasted in switching between processes and increases overheads. If it is high, the algorithm just works like FCFS and cannot be used in time sharing systems. The algorithm performance depends on quantum value. Turnaround time and waiting time are the criteria of the system which should be maintained as less as possible. Standard RR (SRR) algorithm does not posses logic in fixing quantum value. In our paper we propose Low-power Switching (LS) algorithm which reduces context switching and also reduces average waiting time and average turnaround time. So throughput of system will be raised. Experimental analysis shows the feasibility of the proposed algorithm which gives better turnaround time, waiting time and context switching compared with SRR technique and some related works. Pseudo code has been generated to prove the work. |
