OPTIMIZING TIME QUANTUM OF ROUND ROBIN SCHEDULING USING FUZZY LOGIC AND AGE BASED ALLOCATION

Abstract

Now in the modern days computing requires effective use of resources and high work rate. The operating system is software that manages the resources for the user and provides high resource utilization. It helps to use the available resources in a effective way. Processor or CPU is one of the most important resources in the machine. It executes the processes and communicates for data. The modern day systems use multi-programmed environment so as to keep more programs in the memory so as to effectively use the processor. The major task now is to schedule the processes so as to give them processor efficiently. The scheduling of processor is done by program called scheduling algorithm. The function of scheduling algorithm is to efficiently share the processor among the processes. The scheduling algorithms used commonly are First come First Serve, Shortest job first, Round robin scheduling, Priority scheduling. Among these the designer has to generally use one according to the need of the system. Round robin is widely used because the task of finding the next process to schedule is the one that is next in the queue. However the efficiency of round robin algorithm is highly dependent on the time quantum chosen. Therefore, value of time quantum must be chosen appropriately. However, optimal value is different with different processes. Therefore, we propose a system to find the efficient value of time quantum. The algorithm takes into consideration the quantity of processes. Also the average burst time of the processes is seen. Depending on these values a efficient value of time quantum is is decided. The decision is taken by the fuzzy decision system. To give more time to the older processes the aging is also introduced in the model. The process with the more age gets more proportion of the time quantum. The model was implemented in simulation and the results were collected.