In a multitasking environment, one of the important job of an Operating System (OS) is to keep the CPU busy with jobs. In such a way that each process achieves CPU time and possible extreme throughput achieved. One method is to put high priority to desired process and other low. Almost all OS put same scheduling policies on every coming process and do not observe user preferences. The results may not be beneficial for end user which may want some task to run first than other task. A task performed by a user must be given priority on another task. In this paper, we proposed a new scheduling algorithm Enhanced User Preference Based Intelligent Scheduling algorithm (E-UPISA) gives priority dynamically, first time it will give equal priority to all process and with time it will give high priority that users use frequently. The process which will not be used for long time their priority will be decreased. The experimental results display that E-UPISA decreases waiting time, turnaround time and response time for the user preferred processes and improve the whole efficiency of the system when matched with conventional scheduling algorithms.
|Title of host publication||2017 23rd International Conference on Automation and Computing (ICAC)|
|Place of Publication||Huddersfield, UK|
|Publication status||Published (in print/issue) - 7 Sep 2017|