Open AccessJournal Article
Weighted Mean Priority Based Scheduling for Interactive Systems
TL;DR: This paper proposes a newly improved process scheduling algorithm by using dynamic time quantum along with weighted mean that gives better response time making the algorithm useful for interactive systems.
read more
Abstract: Scheduling in Operating System means determining which tasks are supposed to run when there are multiple tasks to be run. Consequently, the efficiency and performance of a system mainly depends on CPU scheduling algorithm where CPU is considered as one of the primary computer resource. Traditionally, Priority Scheduling Algorithm is used for processes in which priority is the determining factor. This paper proposes a newly improved process scheduling algorithm by using dynamic time quantum along with weighted mean. Experimental analysis demonstrates that this proposed algorithm gives better response time making the algorithm useful for interactive systems.
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
Improved Mean Round Robin with Shortest Job First
Radhe Shyam,Sunil Kumar Nandal +1 more
- 01 Jan 2014
TL;DR: In this paper, a new Round Robin Scheduling is designed and it is shown that this Scheduling gives better result compare to Round Robin (RR), Improventround Robin (IRR), Enhanced RoundRobin (ERR), Self Adjectment Round Robin(SARR), FCFS and some other scheduling algorithm.
14
Designing of 2-Stage CPU scheduler using vague logic
TL;DR: A new 2-stage vague logic based scheduler is proposed to handle the uncertainty as well as to optimize both the average and the amount of variation with respect to performance matrices average waiting time, average turnaround time, and average normalized turnaround time.
Implementation of Alternating Median Based Round Robin Scheduling Algorithm
Salman Arif,Naveed Ghaffar,Ali Javed +2 more
- 01 Dec 2016
TL;DR: A novel scheduling algorithm that meets the scheduling criteria at abroader spectrum by giving first priority to the reduction of thenumber of context switches and waiting time and secondpriority to reduction of response time is introduced.
5
Characteristic specific prioritized dynamic average burst round robin scheduling for uniprocessor and multiprocessor environment
TL;DR: A new CPU scheduling algorithm has been proposed, named as CSPDABRR (Characteristic specific Prioritized Dynamic Average Burst Round Robin), that uses seven priority features for calculating priority of processes and uses dynamic time quantum instead of static time quantum used in RR.
A New RR Scheduling Approach for Real Time Systems using Fuzzy Logic
TL;DR: A fuzzy based CPU scheduling algorithm that can be modified for implementation in real time and embedded systems by minimizing its average waiting time, average turnaround time and context switching rate.
References
•Book
Operating Systems Concepts
Abraham Silberschatz
- 16 Dec 2003
TL;DR: Sistem operasi merupakan bagian penting dari system. as mentioned in this paper, kursus pada sistem operating system (SOS), kursu pada SOS mer upakan Bagian Penting Dari pendidikan ilmu komputer.
590
Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes
TL;DR: A new proposed algorithm called Self-Adjustment-Round-Robin (SARR) based on a new approach called dynamic-time-quantum that radically solves the fixed time quantum problem which is considered a challenge for round robin algorithm.
Related Papers (5)
Shatha J. Kadhim,Kasim M. Al-Aubidy +1 more
- 26 Mar 2010
Xueqiao Li,Shuang Liang,Yuan Chen +2 more
- 25 Oct 2010
Damir Poles
- 01 Jul 2013