Abstract
In distributed computing environment, efficient task scheduling is essential to obtain high performance. A vital role of designing and development of task scheduling algorithms is to achieve better makes pan. Several task scheduling algorithms have been developed for homogeneous and heterogeneous distributed computing systems. In this paper, a new static task scheduling algorithm is proposed namely; Leveled DAG Critical Task First (LDCTF) that optimizes the performance of Leveled DAG Prioritized Task (LDPT) algorithm to efficiently schedule tasks on homogeneous distributed computing systems. LDPT was compared to B-level algorithm which is the most famous algorithm in homogeneous distributed systems and it provided better results. LDCTF is a list based scheduling algorithm which depends on sorting tasks into a list according to their priority then scheduling one by one on the suitable processor. LDCTF aims to improve the performance of the system by minimizing the schedule length than LDPT and B-level algorithms.
Highlights
Distributed systems have emerged as powerful platforms for executing parallel applications
Leveled Directed Acyclic Graph (DAG) Critical Task First (LDCTF), Leveled DAG Prioritized Task (LDPT), and B-level algorithms are applied on Standard Task Graph STG [19] as a bench mark, and it was found that LDCTF algorithm is more efficient than LDPT and B-level algorithms
LDCTF is evaluated for different DAGs and found to be giving better results than LDPT algorithm in terms of schedule length, speed up, and efficiency with improving ratio 2.75%, 3.2%, and 1.9% respectively
Summary
Distributed systems have emerged as powerful platforms for executing parallel applications. Researchers have developed many heuristic task-scheduling algorithms such as ISH [10], ETF [11], DLS [12], MH [13],B-level [14] and some heuristics that depend on the critical path such as MCP [15], FCP [16], and CNPT [17]. Among these algorithms, B-level provides the best performance in terms of schedule length, speedup, and efficiency.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have