Augmenting work-greedy assignment schemes with task duplication
Sathiamoorthy Manoharan · 2002
This paper analyses the effect of task duplication on the assignment of task dependency graphs onto concurrent processor systems. It presents a scheme to augment work-greedy assignment schemes with task duplication. Such augmentation results in a time-complexity increase which is well below that of comparable assignment schemes with task duplication. The paper shows empirical results comparing the augmented assignment schemes.