Limit Value Task Scheduling (LVTS): an Efficient Task Scheduling Algorithm for Distributed Computing Environment
G.K.Kamalam1, K.Sentamilselvan2
1Dr.G.K.Kamalam, Assistant Professor(SLG) in Kongu Engineering College Erode
2Mr. K. Sentamilselvan, Assistant Professor 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: 10457-10462 | Volume-8 Issue-4, November 2019. | Retrieval Number: D9228118419/2019©BEIESP | DOI: 10.35940/ijrte.D9228.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: The grid computational environment suits to meet the computational demands of large, diverse groups of tasks. Assigning tasks to heterogeneous wide spread resources seems complex and is termed as an NP-Complete problem. A new task scheduling algorithm, called Limit Value Task Scheduling Algorithm (LVTS) is presented to efficiently identify the appropriate resources, which is responsible for the scheduling process. The proposed algorithm (LVTS) schedules the tasks to the appropriate resources by calculating the limit value of the tasks and the ceil value of the tasks which represents the completion time of the last tasks scheduled in the resource with highest processing capacity. The efficiency of the (LVTS) measured based on makespan and resource utilization. Experimental results indicates LVTS algorithm sounds good than the Min-min on both makespan and resource utilization.
Keywords: Grid, Heuristic Scheduling, Job Scheduling, Task Scheduling.
Scope of the Article: Parallel and Distributed Algorithms.