Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems

Pengcheng Mu (1, 2) , Jean François Nezan (1) , Mickael Raulet (1) , Jean-Gabriel Cousin (1)

1 IETR - Institut d'Electronique et de Télécommunications de Rennes
2 Key Lab for Intelligent Networks and Network Security, School of Electronics and Information Engineering

Modern embedded systems tend to use multiple cores or processors for processing parallel applications. This paper indeed aims at task scheduling with communication contention for parallel embedded systems and proposes three advanced techniques to improve the list scheduling heuristic. Five groups of node levels (two existing groups and three new groups) are firstly used as node priorities to generate node lists. Then the critical child technique improves the selection of a processor in the scheduling process. Finally, the communication delay technique enlarges the idle time intervals on communication links. We also propose an advanced dynamic list scheduling heuristic by combining the three techniques. Experimental results show that the combined advanced dynamic heuristic is efficient to shorten the schedule length for most of the randomly generated DAGs in the cases of medium and high communication. Our method accelerates an application up to 80% in the case of high communication and can also reduce the use of hardware resources.

Mots clés: list scheduling; communication contention; node level; critical child; communication delay

Domaines: Multimédia [cs.MM]; Architectures Matérielles [cs.AR]; Calcul parallèle, distribué et partagé [cs.DC]

Pengcheng Mu, Jean François Nezan, Mickael Raulet, Jean-Gabriel Cousin. Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems. Science China Information Sciences, 2010, 53 (11), pp.2272-2286. ⟨10.1007/s11432-010-4097-3⟩. ⟨hal-00526387⟩