Effect of task duplication on the assignment of dependency graphs
This paper analyses the effect of task duplication on the assignment of task dependency graphs onto concurrent processor systems. It augments work-greedy assignment schemes with task duplication (TD). Such augmentation results in a time-complexity increase which is well below that of comparable assignment schemes with TD. The paper shows empirical results comparing the augmented assignment schemes.
task duplication work-greedy assignments scheduling task allocation