The recent past has seen a number of publications proposing assignment schemes that do not ignore communication costs. Yet, little effort has been made to comparatively assess the performance and end-results of these schemes. This paper presents a comparative assessment of assignment schemes for dependency graphs that take into account the communication costs.To generate an assignment, some parameters describing the program model will be required. In many cases, accurate estimation of these parameters is hard. It is thought that inaccuracies in the estimation would lead to poor assignments. This paper investigates this speculation and presents experimental evidence that shows such inaccuracies do not greatly affect the quality of the assignments.