Efficient communication contention aware scheduling in heterogeneous system
Jiang Yun-lian, Guangzhong Sun, Wentao Wu, Yinlong Xu, Most Co · 2006
A new task scheduling algorithm was proposed on a new parallel system model,which took communication contention into account: at any time,a processor could,at most,receive and send only one message.The algorithm consists of two phases,a listing phase which is quite effective for heterogeneous environments and a task duplication based processor assignment phase.The experimental work based on randomly generated task graph and a real world applications' task graph shows that the proposed algorithm provides substantial improvement over existing work on the communication contention aware model.