A communication contention-aware greedy algorithm for scheduling join task graphs

Aiming at the problem that many previous scheduling algorithms for task graphs always ignore the communication contention, this paper presents a communication contention-aware greedy scheduling algorithm, named CCAG_J, for scheduling join task graphs, which can improve the scheduling performance by serializing the communication edges to integrate the communication awareness into task scheduling. Experimental evaluation validated that the CCAG_J algorithm produces superior results than other compared algorithms in terms of schedule length, number of used processors, speedup and efficiency.