activity
20142025
most citedAn Effective Round Robin Algorithm using Min-Max Dispersion Measure

39 citations · 58 across the 8 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

cs.OS2014★ 9 cited

Enhancing CPU Performance using Subcontrary Mean Dynamic Round Robin (SMDRR) Scheduling Algorithm

Sourav Kumar Bhoi, Sanjaya Kumar Panda, Debashee Tarai

Round Robin (RR) Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. If the time quantum taken is static th…

cs.OS2014★ 39 cited

An Effective Round Robin Algorithm using Min-Max Dispersion Measure

Sanjaya Kumar Panda, Sourav Kumar Bhoi

Round Robin (RR) scheduling algorithm is a preemptive scheduling algorithm. It is designed especially for time sharing Operating System (OS). In RR scheduling algorithm the CPU swi…

cs.NI2014★ 4 cited

SFTP : A Secure and Fault-Tolerant Paradigm against Blackhole Attack in MANET

Jitendra Kumar Rout, Sourav Kumar Bhoi, Sanjaya Kumar Panda

Security issues in MANET are a challenging task nowadays. MANETs are vulnerable to passive attacks and active attacks because of a limited number of resources and lack of centraliz…

cs.OS2014★ 1 cited

A Group based Time Quantum Round Robin Algorithm using Min-Max Spread Measure

Sanjaya Kumar Panda, Debasis Dash, Jitendra Kumar Rout

Round Robin (RR) Scheduling is the basis of time sharing environment. It is the combination of First Come First Served (FCFS) scheduling algorithm and preemption among processes. I…

cs.OS2014★ 4 cited

Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)

Sourav Kumar Bhoi, Sanjaya Kumar Panda, Imran Hossain Faruk

Management of disk scheduling is a very important aspect of operating system. Performance of the disk scheduling completely depends on how efficient is the scheduling algorithm to…