Potential Finish Time and Min-mean Algorithm for allocating Meta-Tasks on distributed Computational Grid
1Mr.K.Sentamilselvan, Assistant Professor in Kongu Engineering College Erode.
2Dr. G. K. Kamalam, Assistant Professor(SLG) in Kongu Engineering College Erode.
Manuscript received on November 11, 2019. | Revised Manuscript received on November 20 2019. | Manuscript published on 30 November, 2019. | PP: 10580-10886 | Volume-8 Issue-4, November 2019. | Retrieval Number: D8449118419/2019©BEIESP | DOI: 10.35940/ijrte.D8449.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Grid is widely distributed and promising technology that enables the integrated and heterogeneous resource sharing for solving computationally challenging scientific engineering problems. In a distributed grid environment, allocating the tasks to the available computing resources proves complex and it is an NP-Complete problem as resources are geo-graphically distributed. In this paper presents a new task scheduling algorithm, called Potential Finish Time Min-mean Task Scheduling Algorithm (PFTSA), to enhance the selection of the suitable resources, which is responsible for the scheduling process. The proposed algorithm (PFTSA) schedules the tasks to the suitable resources by considering the potential finish time of the tasks, average execution time and waiting time of the tasks and average completion time of the resources. The proposed algorithm (PFTSA) results in minimum makespan as well as improved resource utilization. The experimental results indicate the PFTSA is a promising algorithm than the existing Min-min algorithm.
Keywords: Grid, Heuristic Scheduling, Job Scheduling, Task Scheduling.
Scope of the Article: Parallel and Distributed Algorithms.