Improved Round Robin Scheduling Algorithm with Progressive Time Quantum

Paul, Tithi; Hossain, Rahat; Samsuddoha, Md.

doi:10.5120/ijca2019919419

Cited by 13 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Each scheduling method has its own set of characteristics that aid in determining which scheduling algorithm will be more effective in the current problem [19].…”

Section: Scheduling Criteriamentioning

confidence: 99%

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

“…Each scheduling method has its own set of characteristics that aid in determining which scheduling algorithm will be more effective in the current problem [19].…”

Section: Scheduling Criteriamentioning

confidence: 99%

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

2022

IJIES

View full text Add to dashboard Cite

show abstract

“…Each scheduling algorithm has a unique set of properties that help determine which scheduling algorithm will be more useful for the current issue [19]. Main objectives of a good scheduling algorithm are:…”

Section: Context Switchingmentioning

confidence: 99%

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

“…Sistem operasi menyediakan antarmuka antara pengguna dan perangkat keras komputer yang membantu pengguna menangani sistem dengan cara yang nyaman. Sistem operasi modern menjadi lebih kompleks ketika sistem beralih dari tugas tunggal ke lingkungan multitasking (Tithi Paul, 2019).…”

Section: Pendahuluanunclassified

Analisis Algoritma Round Robin pada Penjadwalan CPU

Putra

Purnomo²

2021

jitika

View full text Add to dashboard Cite

ABSTRAK. Penjadwalan adalah konsep penting dalam sistem operasi multiprosesor dan multitasking pada sistem operasi waktu-nyata dengan mengalihkan proses pada CPU. Algoritma Round Robin adalah algoritma yang terkenal pada penjadwalan CPU. Algoritma Round Robin memberikan waktu quantum antara pengalihan proses. Memilih waktu quantum dalam Algoritma Round Robin sangatlah penting, waktu quantum besar akan mengakibatkan context switching lebih sedikit, sementara waktu quantum lebih kecil akan mengakibatkan context switching yang lebih sering. Algoritma Round Robin yang efisien adalah jumlah context switching lebih rendah. Untuk waktu tunggu, ide dasarnya adalah untuk mendapatkan waktu tunggu rata-rata yang lebih kecil, sehingga sistem lebih efisien. Turn around time juga harus minimum, yang berarti juga lebih efisien. Dua studi kasus didiskusikan untuk memahami algoritma ini dengan lebih mendalam. Kata kunci: Algoritma Round Robin, waktu quantum, context switching, rata-rata waktu tunggu, rata-rata turn around time

show abstract

Improved Round Robin Scheduling Algorithm with Progressive Time Quantum

Cited by 13 publications

References 7 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

Analisis Algoritma Round Robin pada Penjadwalan CPU

Contact Info

Product

Resources

About