Abstract

In heterogeneous distributed computing system, huge amount of attention is attracted by task scheduling process in recent days. Scheduling of task is an important problem, where, overall completion of task is completed within a shortest achievable time by scheduling dissimilar task to target processors. This research work concentrates on designing and implementing a fuzzy priority deadline based task scheduling algorithm (FPDSA) having a fuzzy deadline limitation to competent job execution. This proposed FPDSA algorithm is compared with conventional task scheduling techniques like,Improvised Deadline Scheduling Algorithm (IDSA), Earliest Deadline First (EDF) and Prioritized Based Deadline Scheduling Algorithm with respect to Average Actual Execution (AAE) and amount of Non-Delayedand Delayed Jobs. For 4000 tasks, proposed algorithm achieves 7.45%, 27.94% and 30.84% less AAE than IDSA, EDF, and PDSA and for same number of tasks, computational results by proposed FPDSA for non-delayed tasks are 0.32%, 2.17%, and 1.70% higher than IDSA, EDF, and PDSA. This enhances proposed FPDSA’s performance when compared to present scheduling algorithms and illustratesFPDSA is more appropriate scheduling technique forgrid system.

Full Text
Published version (Free)

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 call