Contention-aware scheduling with task duplication

Journal of Parallel and Distributed Computing

Volumn 71, Issue 1, 2011, Pages 77-86

  Sinnen, Oliver ^a   To, Andrea ^a   Kaur, Manpreet ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Contention aware algorithm; Edge scheduling; Task duplication; Task scheduling

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; MULTITASKING; SCHEDULING;

COMMUNICATION RESOURCES; CONTENTION AWARENESS; CONTENTION-AWARE; EXPERIMENTAL EVALUATION; INTER PROCESSOR COMMUNICATION; SCHEDULING MODELS; TASK DUPLICATION; TASK-SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 80455147697     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2010.10.004     Document Type: Article

References (32)

1. T.L. Adam, K.M. Chandy, J.R. Dickson, A comparison of list schedules for parallel processing systems, Communications of the ACM 17 (1974) 685-689.
2. O. Beaumont, V. Boudet, Y. Robert, A realistic model and an efficient heuristic for scheduling with heterogeneous processors, in: HCW'2002, the 11th Heterogeneous Computing Workshop, IEEE Computer Society Press, 2002.
3. D. Bozdag, F. Ozguner, U.V. Catalyurek, Compaction of schedules and a twostage approach for duplication-based DAG scheduling, IEEE Transactions on Parallel and Distributed Systems 20 (6) (2009) 857-871.
4. D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, E.E. Santos, K.E. Schauser, R. Subramonian, T. von Eicken, LogP: a practical model of parallel computation, Communications of the ACM 39 (11) (1996) 78-85.
5. D.E. Culler, J.P. Singh, Parallel Computer Architecture, Morgan Kaufmann Publishers, 1999.
6. S. Darbha, D.P. Agrawal, Optimal scheduling algorithm for distributedmemory machines, IEEE Transactions on Parallel and Distributed Systems 9 (1) (1998) 87-95.
7. A. Gerasoulis, T. Yang, A comparison of clustering heuristics for scheduling DAGs on multiprocessors, Journal of Parallel and Distributed Computing 16 (4) (1992) 276-291.
8. T. Hagras, J. Janeček, A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems, Parallel Computing 31 (7) (2005) 653-670.
9. J.J. Hwang, Y.C. Chow, F.D. Anger, C.Y. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM Journal of Computing 18 (2) (1989) 244-257.
10. T. Kalinowski, I. Kort, D. Trystram, List scheduling of general task graphs under LogP, Parallel Computing 26 (2000) 1109-1128.
11. H. Kasahara, S. Narita, Practical multiprocessor scheduling algorithms for efficient parallel processing, IEEE Transactions on Computers C-33 (1984) 1023-1029.
12. Sang Cheol Kim, Sunggu Lee, J. Hahm, Push-pull: deterministic search-based dag scheduling for heterogeneous cluster systems, IEEE Transactions on Parallel and Distributed Systems 18 (11) (2007) 1489-1502.
13. B. Kruatrachue, Static task scheduling and grain packing in parallel processing systems, Ph.D. Thesis, Oregon State University, USA, 1987.
14. B. Kruatrachue, T.G. Lewis, Grain size determination for parallel processing, IEEE Software 5 (1) (1988) 23-32.
15. J.-C. Liou, M.A. Palis, A new heuristic for scheduling parallel programs on multiprocessor, in: 1998 International Conference on Parallel Architectures and Compilation Techniques, October 1998, pp. 358-365.
16. B.S. Macey, A.Y. Zomaya, A performance evaluation of CP list scheduling heuristics for communication intensive task graphs, in: Parallel Processing Symposium, 1998, Proc. of IPPS/SPDP 1998, 1998, pp. 538-541.
17. L. Marchal, V. Rehn, Y. Robert, F. Vivien, Scheduling algorithms for data redistribution and load-balancing on master-slave platforms, Parallel Processing Letters 17 (1) (2007) 61-77.
18. M.A. Palis, J.-C. Liou, D.S.L. Wei, Task clustering and scheduling for distributed memory parallel architectures, IEEE Transactions on Parallel and Distributed Systems 7 (1) (1996) 46-55.
19. C.H. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM Journal of Computing 19 (2) (1990) 322-328.
20. P. Rebreyend, F.E. Sandnes, G.M. Megson, Static multiprocessor task graph scheduling in the genetic paradigm: a comparison of genotype representations, Research Report 98-25, Ecole Normale Superieure de Lyon, Laboratoire de Informatique du Parallelisme, Lyon, France, 1998.
21. F.E. Sandnes, G.M. Megson, 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, Tamkang University Press, Taipei, Taiwan, 2001, pp. 101-108.
22. V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, MIT Press, 1989.
23. G.C. Sih, E.A. Lee, A compile-time scheduling heuristic for interconnectionconstrained heterogeneous processor architectures, IEEE Transactions on Parallel and Distributed Systems 4 (2) (1993) 175-186.
24. O. Sinnen, Task Scheduling for Parallel Systems, Wiley, 2007.
25. O. Sinnen, L. Sousa, List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures, Parallel Computing 30 (1) (2004) 81-101.
26. O. Sinnen, L. Sousa, On task scheduling accuracy: evaluation methodology and results, The Journal of Supercomputing 27 (2) (2004) 177-194.
27. O. Sinnen, L. Sousa, Communication contention in task scheduling, IEEE Transactions on Parallel and Distributed Systems 16 (6) (2005) 503-515.
28. O. Sinnen, L. Sousa, F.E. Sandnes, Toward a realistic task scheduling model, IEEE Transactions on Parallel and Distributed Systems 17 (3) (2006) 263-275.
29. A. Tam, C.L. Wang, Contention-aware communication schedule for high speed communication, Cluster Computing 6 (4) (2003) 339-353.
30. J.D. Ullman, NP-complete scheduling problems, Journal of Computer and System Sciences 10 (1975) 384-393.
31. M.Y. Wu, D.D. Gajski, Hypertool: a programming aid for message-passing systems, IEEE Transactions on Parallel and Distributed Systems 1 (3) (1990) 330-343.
32. T. Yang, A. Gerasoulis, PYRROS: static scheduling and code generation for message passing multiprocessors, in: Proc. of 6th ACM International Conference on Supercomputing, Washington DC, August 1992, pp. 428-437.