activity
20092024
most citedComparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time

12 citations · 62 across the 25 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

cs.DS2020

Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs

Sheetal Swain, Rakesh Mohanty, Debasis Dwibedy

Shortest Remaining Processing Time (SRPT) is a well known preemptive scheduling algorithm for uniprocessor and multiprocessor systems. SRPT finds applications in the emerging areas…

cs.DS2020

Competitive Analysis of Move-to-Front-or-Middle (MFM) Online List Update Algorithm

Baisakh, Rakesh Mohanty

The design and analysis of efficient algorithms with the knowledge of current and past inputs is a non-trivial and challenging research area in computer science. In many practical…

cs.DS2020★ 3 cited

A Novel Move-To-Front-or-Logarithmic Position (MFLP) Online List Update Algorithm

Baisakh, Rakesh Mohanty

In this paper we propose a novel online deterministic list update algorithm known as Move-To-Front-or-Logarithmic Position (MFLP). Our proposed algorithm MFLP achieves a competitiv…

cs.DS2020

Semi-online Scheduling: A Survey

Debasis Dwibedy, Rakesh Mohanty

In online scheduling, jobs are available one by one and each job must be scheduled irrevocably before the availability of the next job. Semi-online scheduling is a relaxed variant…

cs.DS2020

A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model

Debasis Dwibedy, Rakesh Mohanty

Online scheduling in identical machines with makespan minimization has been a well studied research problem in the literature. In online scheduling, the scheduler receives a list o…

cs.DS2020★ 1 cited

A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling

Debasis Dwibedy, Rakesh Mohanty

Resources of a multi-user system in multi-processor online scheduling are shared by competing users in which fairness is a major performance criterion for resource allocation. Fair…

cs.OS2020★ 4 cited

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems

Debasis Dwibedy, Rakesh Mohanty

Online scheduling has been a well studied and challenging research problem over the last five decades since the pioneering work of Graham with immense practical significance in var…