Browsing by Subject "computer systems"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Analytical Evaluation of Round Robin Algorithm to Find the Optimal Quantum Size(Department of Computer Science and Information Technology, 2007) Pandey, Dhiraj KedarThere are a number of scheduling algorithms used in computer systems today. They all have their own characteristics. Thus selection of the particular scheduling algorithm depends upon the need of the system. One of the most widely used scheduling algorithms in multi programming operating system is round robin. Primitive round robin scheduling algorithm is simply first-come first-served with preemption included. But, now a days, several variations exist for round robin scheduling algorithm. In this dissertation, as the title “An analytical evaluation of round robin scheduling algorithm to find the optimal quantum size” suggests, I am going to analyze the round robin scheduling algorithm. There exists different performance criteria to find the optimality of the quantum size but, here, I chose three of them, namely, processor utilization, turnaround time, and waiting time of the processes. To analyze the round robin algorithm, I simply implemented a simulation of an operating system which we call here a multi programming operating system [1]. Different programs are designed for the analysis purpose which we call here the workload. With the help of simulator and the workload, I analyzed the different performance criteria for different quantum sizes and, came to the conclusion for this dissertation work.Item Analytical Evaluation ofPriority-Based Real-TimeSchedulingAlgorithms forIndependentPeriodicTasks(Department of computer science and information technology,, 2008) Singh, RajeshScheduling is an inevitable part of any multitasking Real-Time Operating System. Thereal-time scheduling schemes must guarantee the execution of the tasks to complete inreal time, i.e. a task may have some completion deadline. Real-time schedulingalgorithms are different fromgeneral scheduling algorithms as they deal with the timeconstraints. Consequently, these real-time scheduling techniques need special attention togive.This dissertation focuses on the study of the two priority-based real-time schedulingalgorithms; Rate Monotonic Scheduling (RMS) and Earliest Deadline First (EDF). Thesealgorithms are analyzed in terms of processor utilization, average turnaround time,context switches, average waiting time, of the tasks for particulartask set.Moreover, the general scheduling algorithms like First Come First Serve (FCFS),Shortest Remaining Time Next (SRT), Shortest Task Next (STN) and Round Robin (RR)are explored for evaluating the real-time scheduling algorithms. Though, they lack mostimportant aspect of the real-time scheduling i.e. time constraints (e.g. deadlines), otherstatistics are analyzed to compensate with the real-time scheduling algorithms.The results of this dissertation provide a foundation for inferring optimality andfeasibility of priority-based real-time scheduling theory. It is expected that these resultswill aid the system designers in the development of predictable real-time systems.Item Disk Scheduling Algorithms(Central Department of Computer Science and Information Technology, 2008) Pariyar, SubashWithout I/O, computers are not usable to users. We know that I/O from secondary memories like disk is slower operations. Scheduling of I/O requests such that response time of requests and become as possible as low and also requests does not suffer from the problem of a starvation is big issue in our computer systems. In this project simulates a disk having 200 tracks, implements different existing disk scheduling algorithms for that simulated disk and seek time of these algorithms for given I/O request set is compared and analyzed.