For a computer-based system, a set of processes must be scheduled such that every process is completed within its deadline. CPU scheduling is the process of allocating CPU among various processes in a multi-processing system. The decision to allocate the CPU to a process has to take into consideration all aspects, including its priority and execution time, as scheduling is guided by a number of factors other than the execution time or priority. It is no longer one-dimensional and has become a multidimensional problem with vagueness and uncertainties such as different CPU loading scenarios. The vagueness and uncertainties associated with the decision to allocate a CPU to a particular process can be addressed using a fuzzy logic approach. In this study, we propose a fuzzy logic-based algorithm for CPU scheduling. The proposed algorithm was compared with conventional scheduling algorithms for different CPU loading scenarios. The proposed method can schedule and execute all processes well within the deadline with a reduced average turn-around and a reduced average waiting time. From the comparison results, it is evident that the proposed algorithm outperforms conventional algorithms in terms of the average turn-around and waiting times.

Keywords: Fuzzy logic, Scheduling, Waiting time, Turn-around time

No potential conflict of interest relevant to this article was reported.