arXiv Open Access 2011

Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm

Rakesh Mohanty Manas Das M. Lakshmi Prasanna Sudhashree

Lihat Sumber

Abstrak

In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing the processes according to the new calculated Fit Factor f and using the concept of dynamic time quantum. We have compared the performance of our proposed Fittest Job First Dynamic Round Robin(FJFDRR) algorithm with the Priority Based Static Round Robin(PBSRR) algorithm. Experimental results show that our proposed algorithm performs better than PBSRR in terms of reducing the number of context switches, average waiting time and average turnaround time.

Topik & Kata Kunci

cs.OS

Penulis (4)

Rakesh Mohanty

Manas Das

M. Lakshmi Prasanna

Sudhashree

Format Sitasi

APA MLA BibTeX

Mohanty, R., Das, M., Prasanna, M.L., Sudhashree (2011). Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm. https://arxiv.org/abs/1109.3075

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓