12 citations · 62 across the 25 of their papers we have counts for
26 papers
A Note On Lookahead In Real Life And Computing
Burle Sharma, Rakesh Mohanty, Sucheta Panda
Past, Present and Future are considered to be three temporal and logical concepts which are well defined by human beings for their existence and growth. We, as human beings, have t…
Semi-online Scheduling with Lookahead
Debasis Dwibedy, Rakesh Mohanty
The knowledge of future partial information in the form of a lookahead to design efficient online algorithms is a theoretically-efficient and realistic approach to solving computat…
A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree
Debasis Dwibedy, Rakesh Mohanty
We study the computational complexity of the non-preemptive scheduling problem of a list of independent jobs on a set of identical parallel processors with a makespan minimization…
New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines
Debasis Dwibedy, Rakesh Mohanty
Design and analysis of constant competitive deterministic semi-online algorithms for the multi-processor scheduling problem with small number of identical machines have gained sign…
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…
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…