Open AccessLimit Value Task Scheduling (LVTS): an Efficient Task Scheduling Algorithm for Distributed Computing Environment
Author(s) -
Dr.G.K. Kamalam*,
Mr.K. Sentamilselvan
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d9228.118419
Subject(s) - computer science , job shop scheduling , scheduling (production processes) , distributed computing , grid computing , grid , fair share scheduling , dynamic priority scheduling , limit (mathematics) , algorithm , rate monotonic scheduling , mathematical optimization , mathematics , computer network , quality of service , mathematical analysis , routing (electronic design automation) , geometry
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.