Constructive algorithms for mapping and scheduling take advantage of short execution times. However, since decisions for the mapping have to be made at a time when not all information of dynamic effects is available, unfavorable situations can arise which result in a degraded performance. In this paper, an enhancement for a constructive algorithm is shown to be effective for real-world applications. Improvements of the performance can be achieved by considering additional information, such as a look ahead of mandatory transfers. Additionally, an algorithm to determine mutual exclusion for arbitrary connected nodes is shown.
['Winthir Brunnbauer', 'Thomas Wild', 'Jürgen Foag', 'Nuria Pazos']
A constructive algorithm with look-ahead for mapping and scheduling of task graphs with conditional edges