A hybrid approach for scheduling applications in cloud computing environment

Cloud computing plays an important role in our daily life. It has direct and positive impact on share and update data, knowledge, storage and scientific resources between various regions. Cloud computing performance heavily based on job scheduling algorithms that are utilized for queue waiting in modern scientific applications. The researchers are considered cloud computing a popular platform for new enforcements. These scheduling algorithms help in design efficient queue lists in cloud as well as they play vital role in reducing waiting for processing time in cloud computing. A novel job scheduling is proposed in this paper to enhance performance of cloud computing and reduce delay time in queue waiting for jobs. The proposed algorithm tries to avoid some significant challenges that throttle from developing applications of cloud computing. However, a smart scheduling technique is proposed in our paper to improve performance processing in cloud applications. Our experimental result of the proposed job scheduling algorithm shows that the proposed schemes possess outstanding enhancing rates with a reduction in waiting time for jobs in queue list

Enhanced user preference based intelligent scheduling algorithm (E-UPISA)

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