Abstract
Grid computing is the framework of computer systems that provides high performance computing environment. The challenging issue in grid computing is to design efficient and reliable task scheduling algorithms for efficient utilization of grid computing. In this paper, we are proposing a new Improvised Prioritized Deadline (IPD) based scheduling algorithm for efficient task execution with deadline constraints of users’ tasks. The proposed algorithm considers the processing power of the resources while scheduling the tasks. Performance comparison of the algorithm has been done with the other task scheduling algorithms such as Earliest Deadline First (EDF) and Prioritized Based Deadline Scheduling Algorithm (PDSA). The proposed algorithm improves 45%-70% with respect to the average tardiness over the PDSA algorithm. The proposed algorithm also shows good results with respect to the number of non-delayed tasks. In the cases the purposed improvised algorithm has shown good results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
