An Efficient Customized Round Robin Algorithm for CPU Scheduling

Sharma, Priyanka; Sharma, Yatendra Mohan

doi:10.1007/978-981-15-9689-6_68

Cited by 3 publications

(15 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proposed algorithm (MMRR) is compared with Amended Dynamic Round Robin (ADRR) [15], Hybrid Round Robin (HYRR) [17], An efficient Customized Round Robin (EDRR) [16] and Median average Round Robin (MARR) [18]. All of these algorithms are compared with Round Robin algorithm [8] in order to evaluate their performance.…”

Section: Results Analysismentioning

confidence: 99%

“…If any process completes its first cycle of time quantum and the remaining burst time of this process is greater than 20% of its total burst time, then those processes will go for the second cycle of the processing; otherwise, the CPU will complete the processes. In [16], an improvement is applied to the Round Robin algorithm named an efficient customized Round Robin algorithm (EDRR) by choosing a dynamic time quantum that would let a process to complete if the remaining execution time was less than or equal to 0.2th of the total execution time. The maximum burst time is founded from the available processes in the ready queue.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Fig. 2 to 7 show the Gantt charts for the algorithms; RR [8], ADRR [15], HYRR [17], EDRR [16], MARR [18] and the proposed algorithm (MMRR). The processes are entered in the ready queue in their order; P1=42, P2=101, P3=135, P4=68 and P5=170.…”

Section: Case 1: Process Are In Randommentioning

confidence: 99%

“…Fig. 9 to 14 show the Gantt charts for the algorithms; RR [8], ADRR [15], HYRR [17], EDRR [16], MARR [18] and the proposed algorithm (MMRR).…”

Section: Case 2: the Incoming Burst Time In An Increasing Ordermentioning

confidence: 99%

“…Furthermore, the processes are sorted in ascending order of their burst time, and then the proposed algorithm is applied to each process to improve turnaround time, waiting time, and context switch. In comparison to the other RR techniques discussed in this work, the drawbacks of the discussed algorithms like ADRR [15], HYRR [16], EDRR [17] and MARR [18] are that they give a large average waiting time, average turnaround time and number of context switches. The contribution of this work is to: 1-Minimizes average waiting time and average turnaround time.…”

Section: Introductionmentioning

confidence: 97%

See 4 more Smart Citations

A New Round Robin Algorithm for Task Scheduling in Real-time System

2022

IJIES

View full text Add to dashboard Cite

The modern human life is strongly reliant on real-time systems. The operating system is one of the most significant real-time systems. To meet the demands of the future, operating systems must be upgraded. Nowadays, a lot of systems are used; like mobile applications and internet of things. Task scheduling is so important in the operating system to enhance the performance in these systems. Round Robin algorithm has been widely used in task scheduling. In this paper, a Median Mean Round Robin (MMRR) algorithm is proposed to significantly enhance the performance of the Round Robin algorithm. The proposed algorithm finds an optimal dynamic time quantum └(median+ mean)/2)┘ and generated for each cluster depending on the remaining burst time of the processes. The performance has been enhanced in terms of waiting time, turnaround time and context switching. The experimental results show that the proposed algorithm outperforms ADRR, HYRR, EDRR and MARR algorithms.

show abstract

Section: Results Analysismentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Case 1: Process Are In Randommentioning

confidence: 99%

“…Fig. 9 to 14 show the Gantt charts for the algorithms; RR [8], ADRR [15], HYRR [17], EDRR [16], MARR [18] and the proposed algorithm (MMRR).…”

Section: Case 2: the Incoming Burst Time In An Increasing Ordermentioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

See 3 more Smart Citations

A New Round Robin Algorithm for Task Scheduling in Real-time System

2022

IJIES

View full text Add to dashboard Cite

show abstract

MMMRR: a Modified Median Mean Round Robin Algorithm for Task Scheduling

2022

IJIES

View full text Add to dashboard Cite

Real-time task scheduling is a critical part of systems since processes must finish their work at a certain time. Large data streams require high energy efficiency and rapid response times. Real-time system performance must be improved through task scheduling on resources. Numerous researchers have recently and rapidly proposed enormous efforts with enhancements in numerous task scheduling methods. Round Robin algorithm has been commonly utilized in task scheduling. In this paper, a Modified Median Mean Round Robin (MMMRR) algorithm is proposed to significantly enhance the performance of the Round Robin algorithm. The proposed algorithm finds an ideal dynamic time quantum └(median+ mean)/2)┘ and generated for each round depending on the remaining burst time of the processes. The system performance has been enhanced in terms of waiting time, turnaround time and context switching. The experimental results show that the proposed algorithm outperforms ADRR, HYRR, EDRR, MARR and MMRR algorithms.

show abstract

“Multi-Criteria Group Decision Making Approach for Scheduling Algorithms Selection by Short Term Scheduler using Fuzzy TOPSIS”.

Riddhi Garg, Shubham Kumar, Atul Kumar Goel, M. K. Sharma

2024

jes

View full text Add to dashboard Cite

The fundamental objective of the CPU scheduler is to equitably and effectively allocate CPU time among competing processes. Within the realm of schedulers, the short-term scheduler specifically addresses this objective by selecting processes from the ready queue for execution on the CPU, guided by various scheduling algorithms. The critical challenge faced by the short-term scheduler lies in the prudent selection of the most suitable algorithm, as an erroneous choice can detrimentally impact system performance, leading to increased waiting and response times for processes. To surmount this challenge, we employ the Fuzzy TOPSIS method within the framework of Multi-Criteria Decision Making (MCDM) to rank scheduling algorithms, taking into account both quantitative and qualitative factors. The proposed approach involves two steps: firstly, defining criteria for algorithm selection, and secondly, obtaining linguistic ratings from experts for potential alternatives based on the specified criteria. The principal aim of this investigation is to utilize the Fuzzy TOPSIS method, integrating fuzzy sets, to produce comprehensive scores that assist in selecting the optimal alternative.

show abstract

An Efficient Customized Round Robin Algorithm for CPU Scheduling

Cited by 3 publications

References 4 publications

A New Round Robin Algorithm for Task Scheduling in Real-time System

A New Round Robin Algorithm for Task Scheduling in Real-time System

MMMRR: a Modified Median Mean Round Robin Algorithm for Task Scheduling

“Multi-Criteria Group Decision Making Approach for Scheduling Algorithms Selection by Short Term Scheduler using Fuzzy TOPSIS”.

Contact Info

Product

Resources

About