Open AccessJournal Article
Two Queue based Round Robin Scheduling Algorithm for CPU Scheduling
Srishty Jindal,Priyanka Grover +1 more
TL;DR: A two queue based Round Robin Scheduling Algorithm is proposed that reduces the waiting time and turnaround time when there are less or equal numbers of I/O intensive processes.
read more
Abstract: Multitasking and multiuser operating system’s performance depends on the efficiency of scheduling algorithm. Most commonly used Round Robin scheduling algorithm may not give optimal result if the burst time of processes is very high as compared to the time quantum of Round Robin algorithm. In this case, context switching and turnaround time of processes is very high. In this paper, a two queue based Round Robin Scheduling Algorithm is proposed. In the proposed approach two queues are used. One queue is exclusively used for CPU intensive processes and other queue is used for I/O intensive processes. This reduces the waiting time and turnaround time when there are less or equal numbers of I/O intensive processes. Performance Analysis depending upon CPU intensive and I/O intensive processes shows that it provides better results.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Modern Operating Systems
Luca Faust
- 01 Jan 2016
TL;DR: The modern operating systems is universally compatible with any devices to read, and is available in the book collection an online access to it is set as public so you can get it instantly.
370
An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process
TL;DR: This paper focuses on Round Robin Scheduling algorithm and various issues related to it and proposes an algorithm that categorizes available processes into High Priority processes and Low Priority process.
•Dissertation
A method for predicting hardware resource usage for Electronic Control Units
Mohammed Elghoz,Einar Nilsson +1 more
- 01 Jan 2015
TL;DR: This thesis work was carried out on the onboard telematics department of Volvo Group Trucks and the main focus was to find a method to predict the required hardware resources needed when adding or changing functions on the telematic gateway unit.
References
Operating System Concepts
Abraham Silberschatz,Peter Baer Galvin,Greg +2 more
- 01 Jan 2012
TL;DR: In this article, Abraham Silberschatz and Peter Galvin discuss key concepts that are applicable to a variety of operating systems and present a large number of examples taken from common operating systems, including WindowsNT and Solaris 2.
2.4K
Modern Operating Systems
Luca Faust
- 01 Jan 2016
TL;DR: The modern operating systems is universally compatible with any devices to read, and is available in the book collection an online access to it is set as public so you can get it instantly.
370
Feedback Queueing Models for Time-Shared Systems
TL;DR: Time-shared processing systems (e.g. communication or computer systems) are studied by considering priority disciplines operating in a stochastic queueing environment, with quantum-controlled feedback models providing rapid service for customers with short service-time requirements.
106
Calculating Dynamic Time Quantum for Round Robin Process Scheduling Algorithm
TL;DR: This paper has presented amelioration to the conventional round robin algorithm by evaluating the time quantum on the basis of the burst times of the various processes waiting in the ready queue with a direct impact on various performance parameters like turnaround time, waiting time, response time and the number of context switches.
•Proceedings Article
Refining Initial Points for K-Means Clustering
Paul S. Bradley,Usama M. Fayyad +1 more
- 24 Jul 1998
TL;DR: A procedure for computing a refined starting condition from a given initial one that is based on an efficient technique for estimating the modes of a distribution that allows the iterative algorithm to converge to a “better” local minimum.