Rakesh Mohanty | IIT Madras (original) (raw)

Papers by Rakesh Mohanty

ACM SIGACT News

In the modern interactive computing era, computational problems such as scheduling, rout- ing, se... more 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 knows the entire input sequence at the beginning. The design of mathematical models and efficient al- gorithms for the online framework constitutes a challenging and competitive area of research in Theoretical Computer Science. The researchers have considered competitive analysis as a well-de ned and standard method to measure the performance of online algorithms.

We study the computational complexity of the non-preemptive scheduling problem of a list of indep... more 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 Solution Space Tree (SSST)} data structure. The properties of the \textit{SSST} are formally defined and characterized through our analytical results. We develop a unique technique to show the problem mathcalNP\mathcal{NP}mathcalNP using the SSST and the \textit{Weighted Scheduling Solution Space Tree (WSSST)} data structures. We design the first non-deterministic polynomial-time algorithm named \textit{Magic Scheduling (MS)} for the problem based on the reduction framework. We also define a new variant of multiprocessor scheduling by including the user as an additional input parameter. We formally establish the complexity class of the variant by the reduction p...

ArXiv, 2022

We study the computational complexity of the non-preemptive scheduling problem of a list of indep... more 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 Scheduling Solution Space Tree (SSST) data structure. The properties of the SSST are formally defined and characterized through our analytical results. We develop a unique technique to show the problem NP using the SSST and the Weighted Scheduling Solution Space Tree (WSSST) data structures. We design the first non-deterministic polynomial-time algorithm named Magic Scheduling (MS) for the problem based on the reduction framework. We also define a new variant of multiprocessor scheduling by including the user as an additional input parameter. We formally establish the complexity class of the variant by the reduction principle. Finally, we conclude the article by ex...

Proceedings of the Seventh International Conference on Mathematics and Computing, 2022

For the List Accessing Problem, Move-To-Front(MTF) algorithm has been proved to be the best perfo... more 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 new method of experimental analysis for our proposed algorithm. Our experimental analysis shows that IMTF is performing better than MTF algorithm.

In this paper we propose a novel online deterministic list update algorithm known as Move-To-Fron... more 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 competitive ratio of 2 for larger list with respect to static optimum offline algorithm, whereas MFLP is not competitive for smaller list. We also show that MFLP is 2 competitive with respect to dynamic optimum offline algorithm. Our results open up a new direction of work towards classifying the online algorithms based on competitive and not competitive.

CPU being considered a primary computer resource, its scheduling is central to operating-system d... more 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 efficient technique in the process scheduling algorithm by using dynamic time quantum in Round Robin. Our approach is based on the calculation of time quantum twice in single round robin cycle. Taking into consideration the arrival time, we implement the algorithm. Experimental analysis shows better performance of this improved algorithm over the Round Robin algorithm and the Shortest Remaining Burst Round Robin algorithm. It minimizes the overall number of context switches, average waiting time and average turn-around time. Consequently the throughput and CPU utilization is better.

Resources of a multi-user system in multi-processor online scheduling are shared by competing use... more 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 a formal fairness model has been well defined in the literature. This motivates us to explore and define a new model to ensure algorithmic fairness with quantitative performance measures based on optimization of the user's objective. In this paper, we propose a new model for fairness in Multi-user Multi-processor Online Scheduling Problem(MUMPOSP). We introduce and formally define quantitative fairness measures based on user's objective by optimizing makespan for individual user in our proposed fairness model. We also define the unfairness of deprived users and absolute fairness of an algorithm. We obtain lower bound results f...

Online algorithm has been an emerging area of interest for researchers in various domains of comp... more 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 and explore the performance of Graham's online list scheduling algorithm(LSA) for independent jobs. In the literature, LSA has already been proved to be 2-1/m competitive, where m is the number of machines. We present two new upper bound results on competitive analysis of LSA. We obtain upper bounds on the competitive ratio of 2-2/m and 2-m^2-m+1/m^2 respectively for practically significant two special classes of input job sequences. Our analytical results can motivate the practitioners to design improved competitive online algorithms for the m-machine list scheduling problem by characterization of real life input sequences.

CPU being considered a primary computer resource, its scheduling is central to operating-system d... more 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 efficient technique in the process scheduling algorithm by using dynamic time quantum in Round Robin. Our approach is based on the calculation of time quantum twice in single round robin cycle. Taking into consideration the arrival time, we implement the algorithm. Experimental analysis shows better performance of this improved algorithm over the Round Robin algorithm and the Shortest Remaining Burst Round Robin algorithm. It minimizes the overall number of context switches, average waiting time and average turn-around time. Consequently the throughput and CPU utilization is better.

ArXiv, 2020

Online scheduling has been a well studied and challenging research problem over the last five dec... more 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 management in transportation, industrial manufacturing and production. In this problem, a sequence of jobs is received one by one in order by the scheduler for scheduling over a number of machines. On arrival of a job, the scheduler assigns the job irrevocably to a machine before the availability of the next job with an objective to minimize the completion time of the scheduled jobs. This paper highlights the state of the art contributions for online scheduling of a sequence of independent jobs on identical and uniform related machines with a special focus on preemptive and non-preemptive processing formats by considering makespan minimization as t...

ArXiv, 2020

Online algorithm has been an emerging area of interest for researchers in various domains of comp... more Online algorithm has been an emerging area of interest for researchers in various domains of computer science. The online mmm-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 and explore the performance of Graham's online \textit{list scheduling algorithm(LSA)} for independent jobs. In the literature, \textit{LSA} has already been proved to be 2−frac1m2-\frac{1}{m}2−frac1m competitive, where mmm is the number of machines. We present two new upper bound results on competitive analysis of \textit{LSA}. We obtain upper bounds on the competitive ratio of 2−frac2m2-\frac{2}{m}2−frac2m and 2−fracm2−m+1m22-\frac{m^2-m+1}{m^2}2−fracm2−m+1m2 respectively for practically significant two special classes of input job sequences. Our analytical results can motivate the practitioners to design improved competitive online algorithms for the mmm-machine list scheduling proble...

ArXiv, 2020

Resources of a multi-user system in multi-processor online scheduling are shared by competing use... more 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 a formal fairness model has been well defined in the literature. This motivates us to explore and define a new model to ensure algorithmic fairness with quantitative performance measures based on optimization of the user's objective. In this paper, we propose a new model for fairness in Multi-user Multi-processor Online Scheduling Problem(MUMPOSP). We introduce and formally define quantitative fairness measures based on user's objective by optimizing makespan for individual user in our proposed fairness model. We also define the unfairness of deprived users and absolute fairness of an algorithm. We obtain lower bound results f...

2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2016

ArXiv, 2020

Shortest Remaining Processing Time (SRPT) is a well known preemptive scheduling algorithm for uni... more 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 systems and routing of packets across several links as per bandwidth availability in data communications. SRPT has been proved to be optimal for the settings, where the objective is to minimize the mean response time of a list of jobs. According to our knowledge, there is less attention on the study of online SRPT with respect to the minimization of makespan as a performance criterion. In this paper, we study the SRPT algorithm for online scheduling in multiprocessor systems with makespan minimization as an objective. We obtain improved constant competitiveness results for algorithm SRPT for special classes of online job sequences based ...

2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2017

Rectangle packing is a well studied NP-complete problem in which smaller rectangles are packed in... more Rectangle packing is a well studied NP-complete problem in which smaller rectangles are packed in an enclosing larger rectangle to minimize wastage of space. Rectangle packing is used in many applications such as scheduling of jobs, allocating memory, VLSI floor planning, pixel art and mobile components packing. In this paper, we study and analyze two online rectangle packing algorithms such as Next Fit and Fit Fit. We obtain interesting constant competitive ratios for square and rectangle packing. Our analytical results shows that FF performs better than NF for both square and rectangle packing for special classes of inputs.

ArXiv, 2020

The design and analysis of efficient algorithms with the knowledge of current and past inputs is ... more 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 applications the future inputs are not available to the algorithm at any instance of time. So the algorithm has to make decisions based on a sequence of inputs that are in order and on the fly. Such algorithms are known as online algorithms. For measuring the performance of online algorithms, a standard measure, known as competitive analysis, has been extensively used in the literature. List update problem is a well studied research problem in the area of online algorithms since last few decades. One of the widely used deterministic online list update algorithm is the Move-To-Front (MTF) algorithm, which has been shown to be 2-competitive with best performance in practical real life inputs. In this paper we analyse the Move-to-Front-or-Middle (MFM) algorithm using competitive analysis by addressing one of ...

In-spite of facilities and ambiances available in an organization, novice students often face cha... more 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 questions from trivial to nontrivial level in a systematic way to explore the learning patterns. We propose a learning model, which we popularly call as What-Why- How (WWH) model, for providing a framework to strengthen learning skills. Computational thinking will be a fundamental skill, which can be used by everyone in future to strengthen and enhance learning. It is a thought process that involves formulating problems so that solutions can be represented as computational steps and algorithms. In our work, we integrate the computational thinking approach in our proposed WWH model of learning and develop a novel framework to resolve some o...

Computers & Operations Research, 2021

ArXiv, 2011

In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing th... more 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(PBSRR) algorithm. Experimental results show that our proposed algorithm performs better than PBSRR in terms of reducing the number of context switches, average waiting time and average turnaround time.

ACM SIGACT News

In the modern interactive computing era, computational problems such as scheduling, rout- ing, se... more 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 knows the entire input sequence at the beginning. The design of mathematical models and efficient al- gorithms for the online framework constitutes a challenging and competitive area of research in Theoretical Computer Science. The researchers have considered competitive analysis as a well-de ned and standard method to measure the performance of online algorithms.

We study the computational complexity of the non-preemptive scheduling problem of a list of indep... more 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 Solution Space Tree (SSST)} data structure. The properties of the \textit{SSST} are formally defined and characterized through our analytical results. We develop a unique technique to show the problem mathcalNP\mathcal{NP}mathcalNP using the SSST and the \textit{Weighted Scheduling Solution Space Tree (WSSST)} data structures. We design the first non-deterministic polynomial-time algorithm named \textit{Magic Scheduling (MS)} for the problem based on the reduction framework. We also define a new variant of multiprocessor scheduling by including the user as an additional input parameter. We formally establish the complexity class of the variant by the reduction p...

ArXiv, 2022

We study the computational complexity of the non-preemptive scheduling problem of a list of indep... more 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 Scheduling Solution Space Tree (SSST) data structure. The properties of the SSST are formally defined and characterized through our analytical results. We develop a unique technique to show the problem NP using the SSST and the Weighted Scheduling Solution Space Tree (WSSST) data structures. We design the first non-deterministic polynomial-time algorithm named Magic Scheduling (MS) for the problem based on the reduction framework. We also define a new variant of multiprocessor scheduling by including the user as an additional input parameter. We formally establish the complexity class of the variant by the reduction principle. Finally, we conclude the article by ex...

Proceedings of the Seventh International Conference on Mathematics and Computing, 2022

For the List Accessing Problem, Move-To-Front(MTF) algorithm has been proved to be the best perfo... more 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 new method of experimental analysis for our proposed algorithm. Our experimental analysis shows that IMTF is performing better than MTF algorithm.

In this paper we propose a novel online deterministic list update algorithm known as Move-To-Fron... more 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 competitive ratio of 2 for larger list with respect to static optimum offline algorithm, whereas MFLP is not competitive for smaller list. We also show that MFLP is 2 competitive with respect to dynamic optimum offline algorithm. Our results open up a new direction of work towards classifying the online algorithms based on competitive and not competitive.

CPU being considered a primary computer resource, its scheduling is central to operating-system d... more 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 efficient technique in the process scheduling algorithm by using dynamic time quantum in Round Robin. Our approach is based on the calculation of time quantum twice in single round robin cycle. Taking into consideration the arrival time, we implement the algorithm. Experimental analysis shows better performance of this improved algorithm over the Round Robin algorithm and the Shortest Remaining Burst Round Robin algorithm. It minimizes the overall number of context switches, average waiting time and average turn-around time. Consequently the throughput and CPU utilization is better.

Resources of a multi-user system in multi-processor online scheduling are shared by competing use... more 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 a formal fairness model has been well defined in the literature. This motivates us to explore and define a new model to ensure algorithmic fairness with quantitative performance measures based on optimization of the user's objective. In this paper, we propose a new model for fairness in Multi-user Multi-processor Online Scheduling Problem(MUMPOSP). We introduce and formally define quantitative fairness measures based on user's objective by optimizing makespan for individual user in our proposed fairness model. We also define the unfairness of deprived users and absolute fairness of an algorithm. We obtain lower bound results f...

Online algorithm has been an emerging area of interest for researchers in various domains of comp... more 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 and explore the performance of Graham's online list scheduling algorithm(LSA) for independent jobs. In the literature, LSA has already been proved to be 2-1/m competitive, where m is the number of machines. We present two new upper bound results on competitive analysis of LSA. We obtain upper bounds on the competitive ratio of 2-2/m and 2-m^2-m+1/m^2 respectively for practically significant two special classes of input job sequences. Our analytical results can motivate the practitioners to design improved competitive online algorithms for the m-machine list scheduling problem by characterization of real life input sequences.

CPU being considered a primary computer resource, its scheduling is central to operating-system d... more 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 efficient technique in the process scheduling algorithm by using dynamic time quantum in Round Robin. Our approach is based on the calculation of time quantum twice in single round robin cycle. Taking into consideration the arrival time, we implement the algorithm. Experimental analysis shows better performance of this improved algorithm over the Round Robin algorithm and the Shortest Remaining Burst Round Robin algorithm. It minimizes the overall number of context switches, average waiting time and average turn-around time. Consequently the throughput and CPU utilization is better.

ArXiv, 2020

Online scheduling has been a well studied and challenging research problem over the last five dec... more 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 management in transportation, industrial manufacturing and production. In this problem, a sequence of jobs is received one by one in order by the scheduler for scheduling over a number of machines. On arrival of a job, the scheduler assigns the job irrevocably to a machine before the availability of the next job with an objective to minimize the completion time of the scheduled jobs. This paper highlights the state of the art contributions for online scheduling of a sequence of independent jobs on identical and uniform related machines with a special focus on preemptive and non-preemptive processing formats by considering makespan minimization as t...

ArXiv, 2020

Online algorithm has been an emerging area of interest for researchers in various domains of comp... more Online algorithm has been an emerging area of interest for researchers in various domains of computer science. The online mmm-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 and explore the performance of Graham's online \textit{list scheduling algorithm(LSA)} for independent jobs. In the literature, \textit{LSA} has already been proved to be 2−frac1m2-\frac{1}{m}2−frac1m competitive, where mmm is the number of machines. We present two new upper bound results on competitive analysis of \textit{LSA}. We obtain upper bounds on the competitive ratio of 2−frac2m2-\frac{2}{m}2−frac2m and 2−fracm2−m+1m22-\frac{m^2-m+1}{m^2}2−fracm2−m+1m2 respectively for practically significant two special classes of input job sequences. Our analytical results can motivate the practitioners to design improved competitive online algorithms for the mmm-machine list scheduling proble...

ArXiv, 2020

Resources of a multi-user system in multi-processor online scheduling are shared by competing use... more 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 a formal fairness model has been well defined in the literature. This motivates us to explore and define a new model to ensure algorithmic fairness with quantitative performance measures based on optimization of the user's objective. In this paper, we propose a new model for fairness in Multi-user Multi-processor Online Scheduling Problem(MUMPOSP). We introduce and formally define quantitative fairness measures based on user's objective by optimizing makespan for individual user in our proposed fairness model. We also define the unfairness of deprived users and absolute fairness of an algorithm. We obtain lower bound results f...

2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2016

ArXiv, 2020

Shortest Remaining Processing Time (SRPT) is a well known preemptive scheduling algorithm for uni... more 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 systems and routing of packets across several links as per bandwidth availability in data communications. SRPT has been proved to be optimal for the settings, where the objective is to minimize the mean response time of a list of jobs. According to our knowledge, there is less attention on the study of online SRPT with respect to the minimization of makespan as a performance criterion. In this paper, we study the SRPT algorithm for online scheduling in multiprocessor systems with makespan minimization as an objective. We obtain improved constant competitiveness results for algorithm SRPT for special classes of online job sequences based ...

2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2017

Rectangle packing is a well studied NP-complete problem in which smaller rectangles are packed in... more Rectangle packing is a well studied NP-complete problem in which smaller rectangles are packed in an enclosing larger rectangle to minimize wastage of space. Rectangle packing is used in many applications such as scheduling of jobs, allocating memory, VLSI floor planning, pixel art and mobile components packing. In this paper, we study and analyze two online rectangle packing algorithms such as Next Fit and Fit Fit. We obtain interesting constant competitive ratios for square and rectangle packing. Our analytical results shows that FF performs better than NF for both square and rectangle packing for special classes of inputs.

ArXiv, 2020

The design and analysis of efficient algorithms with the knowledge of current and past inputs is ... more 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 applications the future inputs are not available to the algorithm at any instance of time. So the algorithm has to make decisions based on a sequence of inputs that are in order and on the fly. Such algorithms are known as online algorithms. For measuring the performance of online algorithms, a standard measure, known as competitive analysis, has been extensively used in the literature. List update problem is a well studied research problem in the area of online algorithms since last few decades. One of the widely used deterministic online list update algorithm is the Move-To-Front (MTF) algorithm, which has been shown to be 2-competitive with best performance in practical real life inputs. In this paper we analyse the Move-to-Front-or-Middle (MFM) algorithm using competitive analysis by addressing one of ...

In-spite of facilities and ambiances available in an organization, novice students often face cha... more 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 questions from trivial to nontrivial level in a systematic way to explore the learning patterns. We propose a learning model, which we popularly call as What-Why- How (WWH) model, for providing a framework to strengthen learning skills. Computational thinking will be a fundamental skill, which can be used by everyone in future to strengthen and enhance learning. It is a thought process that involves formulating problems so that solutions can be represented as computational steps and algorithms. In our work, we integrate the computational thinking approach in our proposed WWH model of learning and develop a novel framework to resolve some o...

Computers & Operations Research, 2021

ArXiv, 2011

In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing th... more 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(PBSRR) algorithm. Experimental results show that our proposed algorithm performs better than PBSRR in terms of reducing the number of context switches, average waiting time and average turnaround time.