Scheduling malleable tasks with precedence constraints☆
Keywords
Cited by (0)
- ☆
The preliminary version of this paper was published in Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 86–95. This work was performed in part when the second author was with the University of Kiel and with McMaster University. This research was supported in part by the DFG - Graduiertenkolleg, Effiziente Algorithmen und Mehrskalenmethoden; by the EU Thematic Network APPOL I + II, Approximation and Online Algorithms, IST-1999-14084 and IST-2001-32007; by the EU Research Training Network ARACNE, Approximation and Randomized Algorithms in Communication Networks, HPRN-CT-1999-00112; by the EU Project CRESCCO, Critical Resource Sharing for Cooperation in Complex Systems, IST-2001-33135. The second author was also supported by an MITACS grant of Canada; by the NSERC Discovery Grant DG 5-48923; and by the NSERC Industrial Research and Development Fellowship.