Neetu Goel - Academia.edu (original) (raw)

Papers by Neetu Goel

Research paper thumbnail of An Optimal Mathematical Approach for CPU Scheduling – OMDRRS vs. RR

Prime objective of this paper is to estimate turnaround time, waiting time and context switch of ... more Prime objective of this paper is to estimate turnaround time, waiting time and context switch of any process in CPU scheduling mathematically. CPU scheduling has an esteemed impact on utilization of resources and total quality of the system. The management of processes in the scheduling of CPU is based on various algorithms. The Round Robin scheduling algorithm is relatively better than other existing CPU scheduling algorithm. In this paper CPU Scheduling Algorithms and an optimal mathematical approach using “Optimum Dynamic Round Robin Scheduling” (OMDRRS) has been presented. Based on the experiments executed and results generated by the simulator on a data set of 50 processes, it has been proved that in comparison to the conventional round robin algorithm, OMDRRS algorithm increases efficiency of average waiting time by 36%; that of the average turnaround time 35% and that of context switch by 35%.The mathematical approach of Round Robin and OMDRRS algorithm is transparent enough;...

Research paper thumbnail of A Comparative Study of CPU Scheduling Algorithms

Developing CPU scheduling algorithms and understanding their impact in practice can be difficult ... more Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system kernel code and measure the resulting performance on a consistent workload of real applications. As processor is the important resource, CPU scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. This paper presents a state diagram that depicts the comparative study of various scheduling algorithms for a single CPU and shows which algorithm is best for the particular situation. Using this representation, it becomes much easier to understand what is going on inside the system and why a different set of processes is a candidate for the allocation of the CPU at different time. The objective of the study is to analyze the high efficient CPU scheduler on design of the high quality scheduling algorithms which suits the scheduling goals.

Research paper thumbnail of Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm

International Journal of Computer Applications, 2013

CPU scheduling has valiant effect on resource utilization as well as overall quality of the syste... more CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in timeshared systems, but it performs more number of context switches, larger waiting time and larger response time. The devised tool "OMDRRS" was utilized to simulate the four algorithms (FCFS, SJF, ROUND ROBIN & Proposed Dynamic Round Robin Algorithm) utilizing either manual entered process with burst time as well as system generated processes with randomly generated burst time. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, in this paper we produce the implementation of new CPU scheduling algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling (OMDRRS), which calculates intelligent time slice and warps after every round of execution. The results display the robustness of this software, especially for academic, research and experimental use, as well as proving the desirability and efficiency of the probabilistic algorithm over the other existing techniques and it is observed that this OMDRRS projects good performance as compared to the other existing CPU scheduling algorithms.

Research paper thumbnail of Improvised Optimum Multilevel Dynamic Round Robin Algorithm for Optimizing CPU Scheduling

International Journal of Computer Applications, 2015

CPU scheduling has strong effect on resource utilization as well as overall performance of the sy... more CPU scheduling has strong effect on resource utilization as well as overall performance of the system. In order to simulate the behavior of multiple jobs in a multiprogramming computer system needs to be specified. The most important aspect of job scheduling is the ability to create a multi-tasking environment. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. Round Robin 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. The main objective of this paper is to improve the previous OMDRRS with calculates intelligent time slice and warps after every round of execution and assumed that all the processes were come at randomly as well as all the processes have priority. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, we purpose new improved CPU scheduling algorithm called "Optimum Dynamic Round Robin Scheduling" (OMDRR). Our experimental results show that our proposed algorithm performs better in terms of reducing the number of context switch, average waiting time and average turnaround time.

Research paper thumbnail of An Optimal Mathematical Approach for CPU Scheduling – OMDRRS vs. RR

Prime objective of this paper is to estimate turnaround time, waiting time and context switch of ... more Prime objective of this paper is to estimate turnaround time, waiting time and context switch of any process in CPU scheduling mathematically. CPU scheduling has an esteemed impact on utilization of resources and total quality of the system. The management of processes in the scheduling of CPU is based on various algorithms. The Round Robin scheduling algorithm is relatively better than other existing CPU scheduling algorithm. In this paper CPU Scheduling Algorithms and an optimal mathematical approach using “Optimum Dynamic Round Robin Scheduling” (OMDRRS) has been presented. Based on the experiments executed and results generated by the simulator on a data set of 50 processes, it has been proved that in comparison to the conventional round robin algorithm, OMDRRS algorithm increases efficiency of average waiting time by 36%; that of the average turnaround time 35% and that of context switch by 35%.The mathematical approach of Round Robin and OMDRRS algorithm is transparent enough;...

Research paper thumbnail of A Comparative Study of CPU Scheduling Algorithms

Developing CPU scheduling algorithms and understanding their impact in practice can be difficult ... more Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system kernel code and measure the resulting performance on a consistent workload of real applications. As processor is the important resource, CPU scheduling becomes very important in accomplishing the operating system (OS) design goals. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. This paper presents a state diagram that depicts the comparative study of various scheduling algorithms for a single CPU and shows which algorithm is best for the particular situation. Using this representation, it becomes much easier to understand what is going on inside the system and why a different set of processes is a candidate for the allocation of the CPU at different time. The objective of the study is to analyze the high efficient CPU scheduler on design of the high quality scheduling algorithms which suits the scheduling goals.

Research paper thumbnail of Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling Algorithm

International Journal of Computer Applications, 2013

CPU scheduling has valiant effect on resource utilization as well as overall quality of the syste... more CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in timeshared systems, but it performs more number of context switches, larger waiting time and larger response time. The devised tool "OMDRRS" was utilized to simulate the four algorithms (FCFS, SJF, ROUND ROBIN & Proposed Dynamic Round Robin Algorithm) utilizing either manual entered process with burst time as well as system generated processes with randomly generated burst time. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, in this paper we produce the implementation of new CPU scheduling algorithm called An Optimum Multilevel Dynamic Round Robin Scheduling (OMDRRS), which calculates intelligent time slice and warps after every round of execution. The results display the robustness of this software, especially for academic, research and experimental use, as well as proving the desirability and efficiency of the probabilistic algorithm over the other existing techniques and it is observed that this OMDRRS projects good performance as compared to the other existing CPU scheduling algorithms.

Research paper thumbnail of Improvised Optimum Multilevel Dynamic Round Robin Algorithm for Optimizing CPU Scheduling

International Journal of Computer Applications, 2015

CPU scheduling has strong effect on resource utilization as well as overall performance of the sy... more CPU scheduling has strong effect on resource utilization as well as overall performance of the system. In order to simulate the behavior of multiple jobs in a multiprogramming computer system needs to be specified. The most important aspect of job scheduling is the ability to create a multi-tasking environment. The intention should be allowed as many as possible running processes at all time in order to make best use of CPU. Round Robin 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. The main objective of this paper is to improve the previous OMDRRS with calculates intelligent time slice and warps after every round of execution and assumed that all the processes were come at randomly as well as all the processes have priority. In order to simulate the behavior of various CPU scheduling algorithms and to improve Round Robin scheduling algorithm using dynamic time slice concept, we purpose new improved CPU scheduling algorithm called "Optimum Dynamic Round Robin Scheduling" (OMDRR). Our experimental results show that our proposed algorithm performs better in terms of reducing the number of context switch, average waiting time and average turnaround time.