A Static Task Distribute Algorithm Based on Task Relation in LilyTask
Li Xiao · Chinese Journal of Computers · 2005
LilyTask is a parallel programming environment based on generalized task parallel. It allows task relations which cause the waits among tasks. This waste can be detected and minimized by a static task distribution strategy in precompile phase. In this article a new family of scheduling algorithms based on task relation graph, WCP algorithms, are put forward, and the test result compared with another two algorithms ETF and MCP is presented. It shows that ~above algorithms give better performance if the task’s computation cost and communication cost cannot be estimated exactly.