Contention-Aware Scheduling with Task Duplication
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interprocessor communication is task duplication. Certain tasks are duplicated on several processors to produce the data locally and avoid the communication among processors. Most algorithms using task duplication are for the classic model, which allows concurrent communication and ignores contention for communication resources. The recently proposed, more realistic contention model introduces contention awareness into task scheduling by assigning the edges of the task graph to the links of the communication network. It is intuitive that scheduling under such a model benefits even more from task duplication. This paper proposes a contention-aware task duplication scheduling algorithm, after investigating how to use task duplication in the contention model. An extensive experimental evaluation demonstrates the significant improvements to the speedup of the produced schedules.
Unable to display preview. Download preview PDF.
- 1.Beaumont, O., Boudet, V., Robert, Y.: A realistic model and an efficient heuristic for scheduling with heterogeneous processors. In: HCW 2002, the 11th Heterogeneous Computing Workshop. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
- 7.Kruatrachue, B., Lewis, T.G.: Grain size determination for parallel processing. IEEE Software 5(1), 23–32 (1988)Google Scholar
- 8.Liou, J.-C., Palis, M.A.: A new heuristic for scheduling parallel programs on multiprocessor. In: 1998 International Conference on Parallel Architectures and Compilation Techniques, October 1998, pp. 358–365 (1998)Google Scholar
- 9.Sandnes, F.E., Megson, G.M.: An evolutionary approach to static taskgraph scheduling with task duplication for minimised interprocessor traffic. In: Proc. Int. Conf. on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2001), Taipei, Taiwan, July 2001, pp. 101–108. Tamkang University Press (2001)Google Scholar
- 10.Sarkar, V.: Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, Cambridge (1989)Google Scholar
- 16.Tam, A., Wang, C.L.: Contention-aware communication schedule for high speed communication 6(4), 339–353 (2003)Google Scholar