Rakesh Mohanty

Veer Surendra Sai University of Technology | VSSUT · Department of Computer Science and Engineering

In the modern interactive computing era, computational problems such as scheduling, rout- ing, sequencing, and resource management are online in nature. In the online framework, at the outset, an algorithm receives and processes inputs one by one in order without the knowledge of future inputs, unlike in an offline framework, where an algorithm kno...

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 objective. We make a maiden attempt to explore the combinatorial structure showing the exhaustive solution space of the problem by defining the \textit{Scheduling Solutio...

Design of algorithms without complete future input information is a challenging area in Computing. In online scheduling, inputs are given one by one in order and an irrevocable decision is made on each input prior to the availability of subsequent inputs. Online scheduling with identical machines finds extensive applications in emerging areas such...

Shortest Remaining Processing Time (SRPT) is a well-known preemptive scheduling algorithm for uni-processor and multiprocessor systems. Besides processor scheduling, algorithm SRPT finds applications in the emerging areas such as scheduling of client’s requests that are submitted to a web server for accessing static web pages, managing the access r...

In multi-user multi-processor online scheduling, resources are shared among competing users, and fairness is considered to be a major performance criterion for resource allocation by the scheduler. Fairness ensures equality of resource sharing among the users. According to our knowledge, fairness based on the user’s objective has neither been thoro...

In real-life applications, neither all the inputs of an algorithm are available at the outset, as in an offline framework, nor do they occur one by one in order, as in an online setup. Semi-online is an intermediate theoretically and practically significant framework with additional information on the successive inputs to address the limitations of...

Design and analysis of constant competitive deterministic semi-online algorithms for the multi-processor scheduling problem with small number of identical machines have gained significant research interest in the last two decades. In the semi-online scheduling problem for makespan minimization, we are given a sequence of independent jobs one by one...

Shortest Remaining Processing Time (SRPT) is a well known preemptive scheduling algorithm for uniprocessor and multiprocessor systems. SRPT finds applications in the emerging areas such as scheduling of client's requests that are submitted to a web server for accessing static web pages, managing the access requests to files in multiuser database sy...

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 of online scheduling, where an additional memory in terms of buffer or an Extra Piece of Information(EPI) is provided along with input data. The EPI may include one or mo...

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 of jobs one by one and assigns each incoming job on the fly irrevocably to one of the machines before the arrival of the next job. In this paper, we study a variant of the...

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. Fairness ensures equality in resource sharing among the users. According to our knowledge, fairness based on the user's objective has neither been comprehensively studied nor...

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 various applications such as interactive parallel processing, routing in communication networks, distributed data management, client-server communications, traffic managemen...

Rainbow coloring is a special case of edge coloring, where there must be at least one path between every distinct pair of vertices that consists of different color edges. Here, we may use the same color for the adjacent edges of a graph representing two different paths from a single vertex. In online rainbow coloring, we have no priori knowledge ab...

Online algorithm has been an emerging area of interest for researchers in various domains of computer science. The online $m$-machine list scheduling problem introduced by Graham has gained theoretical as well as practical significance in the development of competitive analysis as a performance measure for online algorithms. In this paper, we study...

In-spite of facilities and ambiances available in an organization, novice students often face challenges to develop a right attitude and framework for productive learning. Through a case study in our university, we explore some difficulties and challenges faced by the freshers to strengthen and enhance their learning skills. We focus on generating...

On-line algorithm is an emerging area of research since last five decades with immense theoretical and practical significance. Here the sequence of inputs is received and processed by the algorithm one by one in order. At any instant of time, the algorithm has the knowledge of past and present inputs without knowledge of future inputs. Competitive...

Partitioning is a well studied research problem in the area of VLSI physical design automation. In this problem, input is an integrated circuit and output is a set of almost equal disjoint blocks. The main objective of partitioning is to assign the components of circuit to blocks in order to minimize the numbers of inter-block connections. A partit...

List Update Problem (LUP) or List Accessing Problem (LAP) is a well studied research problem in the area of online algorithms [5] and self organizing data structures [2] since the pioneering work of McCabe [7]. In this problem, the inputs are an unsorted list of distinct items and a sequence of requests where each request is an access operation on...

Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front (MTF) and Transpose (TRANS) are two well known primitive list accessing algorithms. MTF has been proved to be the best performing online algorithm till date in the literature for real life...

List Accessing Problem (LAP) is a problem of significant theoretical and practical interest in the context of linear search. Move-To-Front (MTF) Transpose(TRANS) and Frequency Count(FC) are the three most primitive list accessing algorithms developed in the literature. FC is the static optimal offline algorithm, but it has not been studied extensiv...

Frequency Count (FC) algorithm is considered as the static optimal algorithm for the list accessing problem. In this paper, we have made a study of FC algorithm and explore its limitation. Using the concept of weak look ahead, we have proposed a novel Variant of Frequency Count (VFC) list accessing algorithm. We have evaluated the performance of FC...

List accessing problem has been studied as a problem of significant theoretical and practical interest in the context of linear search. Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front(MTF),Transpose (TRANS) and Frequency Count (FC) are t...

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(P...

CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. We have proposed an efficie...

List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along with a sequence of requests, where each request is an access operation on an element of the list. A list accessing algorithm reorganizes the list while processing a requ...

There are many existing well known cost models for the list accessing problem. The standard cost model developed by Sleator and Tarjan is most widely used. In this paper, we have made a comprehensive study of the existing cost models and proposed a new cost model for the list accessing problem. In our proposed cost model, for calculating the proces...

For the List Accessing Problem, Move-To-Front(MTF) algorithm has been proved to be the best performing online list accessing algorithm till date in the literature[10]. In this paper, we have made a comprehensive analysis of MTF algorithm and developed an Improved-MTF (IMTF) offline algorithm. We have generated two new types of data set and devise a...

In this paper, a new variant of Round Robin (RR) algorithm is proposed which is suitable for soft real time systems. RR algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems. Because it gives more number of context switches, larger waiting time and larger response time. We have proposed a novel algori...

For the list accessing problem, the standard cost model developed by Sleator and Tarjan[5] is most widely used for cost computation. In this paper, we have proposed a new effective cost model for the list accessing problem which uses doubly linked list as the data structure. We have proposed three new variants of MTF, TRANSPOSE and FC algorithms us...

Scheduling is the central concept used frequently in OperatingSystem. It helps in choosing the processes for execution. RoundRobin (RR) is one of the most widely used CPU schedulingalgorithm. But, its performance degrades with respect to contextswitching, which is an overhead and it occurs during eachscheduling. Overall performance of the system de...

Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated i...

The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness results of deterministic and ran...

In this paper, we investigate the optimum offline algorithms for the list update problem and define a new concept, called prefix-suffix subset transfer. Based on this concept, we propose an improved optimal offline algorithm for the list update problem. Our proposed algorithm runs in time O(l2l!n), where l is the size of the list and n is the size...

In this survey paper, we have done a comprehensive study of VLSI placement algorithms in the literature and classified them from different perspectives. After an extensive review, we have performed a chronological analytical study of the simulated annealing based placement algorithm. We have explored the pros and cons of simulated annealing based p...