A false-sharing-eliminable parallel tasks scheduling algorithm based on DAG

Wang, Lisheng; Wang, Kete; Li, Xixi

doi:10.1109/iccasm.2010.5623090

Cited by 2 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The goal of task scheduling algorithm is to allocate the tasks of a parallel program to processors in order to minimize the completion time of the program and economize processors. Since it has been shown the multiprocessor scheduling problem is NP-complete, many researchers have proposed scheduling algorithms based on heuristics [1][2][3][4][5][6][7][8][9][10][11][12][13][14]. It is well known that the complexity and quality of scheduling algorithm largely depend on the task graph structure [3,4].…”

Section: Introductionmentioning

confidence: 99%

A Scheduling Algorithm for Fork-Join DAG in Bus-based and Heterogeneous Environment

Wang¹,

Chen²,

Wang³

2012

Proceedings of the 2nd International Conference on Computer Application and System Modeling

View full text Add to dashboard Cite

The Fork-Join task graph is one of the basic modeling structures for parallel processing. However, many previous scheduling algorithms ignore to economize processors and minimize the total completion time. What's more, many algorithms don't consider the competition caused by bus-based clusters and the heterogeneous of processors in real applications. This paper presents a new algorithm for Fork-Join task graph, considering economy of processors and minimization of the total completion time, the non-parallel communication, and heterogeneous environment as well. We propose a task scheduling algorithm based on task duplication which randomly generated a number of Fork-Join task graphs by producing the task execution time and communication time. Simulation results show that the proposed algorithm has less total completion time and less number of processors than other compared algorithms for more practical applications.

show abstract