A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications

Abstract

Abstract-In practical Cloud/Grid computing systems, DAG scheduling may be faced with challenges arising from severe uncertainty about the underlying platform. For instance, it could be hard to have explicit information about task execution time and/or the availability of resources; both may change dynamically, in difficult to predict ways. In such a setting, the development of various kinds of just-in-time scheduling schemes, which aim at maximizing the parallelism of ready tasks of DAG, seems to be a promising approach to cope with the lack of environment information and achieve efficient DAG execution. Although many attempts have been tried to develop such just-in-time scheduling heuristics, most of them are based on DAG decomposition, which results in complicated and suboptimal solutions for general DAGs. This paper presents a priority-based heuristic, which is not only easy to apply to arbitrary DAGs, but also exhibits comparable or better performance than the existing solutions.

A Task Scheduling Method after Clustering for Data Intensive Jobs in Heterogeneous Distributed Systems

“…In this paper, we supposed off-line scheduling instead of on-line scheduling where tasks are assigned to processor after becoming ready to be executed, e.g., the method proposed in [12]. We assumed that a job is expressed as a directed acyclic graph (DAG), which is known as a workflow type job.…”

A slave ants based ant colony optimization algorithm for task scheduling in cloud computing environments

“…In [8], the authors considered information of tasks (i.e., task completion time and size of tasks) and the information is used in the self-adaptive scheduling technique to reduce total processing time and average response time. To solve dependency issues of cloud tasks, the scheduling problem can be translated to the directed acyclic graph (DAG) [9]. To address the performance issue, the authors of [10] proposed a prioritizing scheme of the DAG of tasks and the authors of [11] proposed an AREA-Oriented scheduling (AO-scheduling) to compensate the defects of cloud based scheduling problems.…”