| Hi-index | 0.00 |
Constructive algorithms for mapping and schedulingtake advantage of short execution times. However, sincedecisions for the mapping have to be made at a time whennot all information of dynamic effects is available, unfavorablesituations can arise which result in a degraded performance.In this paper, an enhancement for a constructivealgorithm is shown to be effective for real-world applications.Improvements of the performance can be achieved byconsidering additional information, such as a look aheadof mandatory transfers. Additionally, an algorithm todetermine mutual exclusion for arbitrary connected nodesis shown.