Work

Limit Value Task Scheduling (LVTS): an Efficient Task Scheduling Algorithm for Distributed Computing Environment

Year: 2019
Type: article
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.
Language: English
Open Access status: diamond
OpenAlex ID: W4232670992
FWCI: 0.119
Cites:
Cited by: 4
Related to: 10