Optimizing layer-based scheduling algorithms for parallel tasks with dependencies

Concurrency and Computation: Practice and Experience

Volumn 23, Issue 8, 2011, Pages 827-849

  Kunis, R ^a   Runger G ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

distributed memory; homogeneous platform; optimization algorithm; parallel tasks with dependencies; task scheduling

Indexed keywords

COMPUTER APPLICATIONS; COMPUTER NETWORKS;

DISTRIBUTED MEMORY; HOMOGENEOUS PLATFORM; OPTIMIZATION ALGORITHMS; PARALLEL TASK; TASK-SCHEDULING;

CONCURRENCY CONTROL;

EID: 79955606982     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1674     Document Type: Article

References (24)

1. Dümmler J, Kunis R, Rünger G,. A comparison of scheduling algorithms for multiprocessor tasks with precedence constraints. Proceedings of 2007 High Performance Computing and Simulation Conference (HPCS'07), ECMS, Prague, Czech Republic, 2007; 663-669.
2. Dümmler J, Kunis R, Rünger G,. Layer-based scheduling algorithms for multiprocessor-tasks with precedence constraints. Proceedings of the International Conference on Parallel Computing: Architectures, Algorithms and Applications (ParCo 2007), Advances in Parallel Computing, vol. 5. IOS Press: Amsterdam, The Netherlands, 2007; 321-328.
3. Rauber T, Rünger G,. Compiler support for task scheduling in hierarchical execution models. Journal of Systems Architecture 1998; 45 (6-7): 483-503. DOI: http://dx.doi.org/10.1016/S1383-7621(98)00019-8.
4. Ludwig W, Tiwari P,. Scheduling malleable and nonmalleable parallel tasks. SODA '94: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM: Philadelphia, PA, 1994; 167-176.
5. Mounie G, Rapine C, Trystram D,. Efficient approximation algorithms for scheduling malleable tasks. SPAA '99: Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures. ACM Press: New York, 1999; 23-32. DOI: http://doi.acm.org/10.1145/305619.305622.
6. Mounie G, Rapine C, Trystram D,. A -approximation algorithm for scheduling independent monotonic malleable tasks. SIAM Journal on Computing 2007; 37 (2): 401-412. (Pubitemid 351584850)
7. Radulescu A, van Gemund A,. A low-cost approach towards mixed task and data parallel scheduling. Proceedings of the 2001 International Conference on Parallel Processing. IEEE Computer Society: Silver Spring, MD, 2001; 69-76.
8. Radulescu A, Nicolescu C, van Gemund A, Jonker P,. CPR: Mixed task and data parallel scheduling for distributed systems. Proceedings of the 15th International Parallel and Distribution Processing Symposium (IPDPS01). IEEE Computer Society: Silver Spring, MD, 2001; 39-48.
9. Ramaswamy S, Sapatnekar S, Banerjee P,. A framework for exploiting task and data parallelism on distributed memory multicomputers. IEEE Transactions on Parallel Distribution Systems 1997; 8 (11): 1098-1116. (Pubitemid 127763322)
10. Lepere R, Trystram D, Woeginger G,. Approximation algorithms for scheduling malleable tasks under precedence constraints. International Journal of Foundations of Computer Science 2002; 13 (4): 613-627.
11. Bansal S, Kumar P, Singh K,. An improved two-step algorithm for task and data parallel scheduling in distributed memory machines. Parallel Computing 2006; 32 (10): 759-774. (Pubitemid 44692335)
12. N'Takpe T, Suter F,. Critical path and area based scheduling of parallel task graphs on heterogeneous platforms. Proceedings of 12th International Conference on Parallel and Distribution Systems (ICPADS06). IEEE Computer Society: Washington, DC, USA, 2006; 3-10. DOI: http://dx.doi.org/10.1109/ICPADS. 2006.32. (Pubitemid 46530685)
13. Hunold S, Rauber T, Suter F,. Redistribution aware two-step scheduling for mixed-parallel applications. Proceedings of the 10th IEEE International Conference on Cluster Computing (Cluster 2008), Tsukuba, Japan, 2008.
14. Vydyanathan N, Krishnamoorthy S, Sabin G, Ãatalyürek Ã, Kurà T, Sadayappan P, Saltz JH,. An integrated approach for processor allocation and scheduling of mixed-parallel applications. Proceedings of the 2006 International Conference on Parallel Processing (ICPP06). IEEE Computer Society: Silver Spring, MD, 2006; 443-450. DOI: http://dx.doi.org/10.1109/ICPP. 2006.22. (Pubitemid 47159072)
15. Vydyanathan N, Krishnamoorthy S, Sabin G, Ãatalyürek Ã, Kurà T, Sadayappan P, Saltz J,. Locality conscious processor allocation and scheduling for mixed parallel applications. Proceedings of the 2006 IEEE International Confernce on Cluster Computing. IEEE: New York, 2006; 1-10.
16. Blazewicz J, Machowiak M, Weglarz J, Kovalyov M, Trystram D,. Scheduling malleable tasks on parallel processors to minimize the makespan. Annals of Operations Research 2004; 129 (1-4): 65-80. (Pubitemid 38892375)
17. Blazewicz J, Kovalyov M, Machowiak M, Trystram D, Weglarz J,. Preemptable malleable task scheduling problem. IEEE Transactions on Computers 2006; 55 (4): 486-490.
18. Jansen K,. Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica 2004; 39: 59-81. (Pubitemid 40871673)
19. Boudet V, Desprez F, Suter F,. One-step algorithm for mixed data and task parallel scheduling without data replication. IPDPS '03: Proceedings of 17th International Symposium on Parallel and Distribution Processing. IEEE Computer Society: Silver Spring, MD, 2003; 41-48.
20. Dümmler J, Kunis R, Rünger G,. A scheduling toolkit for multiprocessor-task programming with dependencies. Proceedings of the 13th International Euro-Par Conference (Lecture Notes in Computer Science, vol. 4641). Springer: Berlin, 2007; 23-32.
21. Kunis R, Rünger G,. Optimization of layer-based scheduling algorithms for mixed parallel applications with precedence constraints using move-blocks. Proceedings of the 17th Euromicro International Conference on Parallel, Distribution and Network-Based Processing (PDP'09). IEEE Computer Society: Silver Spring, MD, 2009; 70-77.
22. Kunis R, Rünger G,. Task-block identification and movement for layer-based scheduling algorithms. Proceedings of 2010 International Conference on High Performance Computing and Simulation (HPCS 2010), Smari W, (ed.). IEEE: New York, 2010; 132-139.
23. IBM Systems and Technology Group. Chemnitz University of Technology powers up with MEGWARE and IBM. IBM Case Study CLC03002-USEN-00, IBM Corporation, 2007.
24. Dutot PF, N'Takpe T, Suter F, Casanova H,. Scheduling parallel task graphs on (almost) homogeneous multicluster platforms. IEEE Transactions on Parallel and Distribution Systems 2009; 20: 940-952. DOI: http:// doi.ieeecomputersociety.org/10.1109/TPDS.2009.11.