Abstract
Scheduling is a well known term in the field of operating system which allows processes for execution. Round-robin (RR) performs better in the time-shared system; as each process allows for execution within a specific time slot i.e time quantum (TQ). The effectiveness of RR scheduling depends on the value of TQ. For further performance enhancement, an efficient average execution time-round-robin (AET-RR) algorithm has been proposed for both online and offline scenario with varying TQ. Both the proposed algorithms (for online and offline) has been thoroughly explained through block diagram, flowchart and example. The experimental analysis shows that our proposed AET-RR algorithm performs better as compared to a conventional RR algorithm in terms of average turnaround time (ATAT), average waiting time (AWT) and number of context switch (NCS) with increasing burst time (BT).
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
