A CRITICAL-PATH AND TOP-LEVEL ATTRIBUTES BASED TASK SCHEDULING ALGORITHM FOR DAG (CPTL)

Abstract

Parallel computing is an important area of research. It is used from scientific to commercial applications. Task scheduling is one of the important research areas of parallel computing. The major objective of any task scheduling algorithm is to minimize the execution time i.e. to reduce the scheduling length. Here, an application program is represented by a directed acyclic graph (DAG). In this paper, we have proposed an efficient CPTL scheduling algorithm which is based on two well-known attributes: Critical Path (CP), and Top-level (T-level). This algorithm is calculated the difference between CP and t-level, which is called CPT attribute. This attribute used as a priority of the tasks, and allocated these tasks on multiprocessor system. The proposed algorithm outperforms over the existing heuristic algorithms such as HLEFT, MCP, ETF, and DLS. CPTL algorithm gives minimum scheduling length. The comparison has been done based on following metrics: scheduling length, speedup, efficiency, load balancing, and normalized scheduling length.