4 citations · 5 across the 12 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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…
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…