Static scheduling of dependent parallel tasks on heterogeneous clusters

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2005, Pages

  Barbosa, J ^b   Morais, C ^a   Nobrega, R ^b   Monteiro, A P ^b  

^a INSTITUTO POLITÉCNICO DE BRAGANÇA   (Portugal)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

Arbitrary precedence graphs; List scheduling; Parallel task; Static scheduling

Indexed keywords

ARBITRARY PRECEDENCE GRAPHS; CLUSTER COMPUTING; DIRECT ACYCLIC GRAPH; EXECUTION TIME; HETEROGENEOUS CLUSTERS; INTERNATIONAL CONFERENCES; LIST SCHEDULING; MAKESPAN; MALLEABLE TASKS; OPTIMIZ ATION PROBLEMS; PAPER ADDRESSES; PARALLEL TASK; PARALLEL TASKS; PRECEDENCE CONSTRAINTS; PROCESSING CAPACITIES; PROCESSING TIME; STATIC SCHEDULING; TOTAL LENGTH;

GRAPH THEORY; PARALLEL ALGORITHMS; SCHEDULING; TREES (MATHEMATICS);

CHLORINE COMPOUNDS;

EID: 50149110975     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2005.347024     Document Type: Conference Paper

References (22)

1. A. K. Amoura, E. Bampis, and J.-C. König. Scheduling algorithms for parallel gaussian elimination with communication costs. IEEE Transactions on Parallel and Distributed Systems, 9(7):679-686, July 1998.
2. J. Barbosa and A.J. Padilha. Algorithm-dependent method to determine the optimal number of computers in parallel virtual machines. In VECPAR'98, volume 1573. Springer-Verlag LNCS, 1998.
3. J. Barbosa, J. Tavares, and A.J. Padilha. Linear algebra algorithms in a heterogeneous cluster of personal computers. In Proceedings of 9th Heterogeneous Computing Workshop, pages 147-159. IEEE CS Press, May 2000.
4. J. Barbosa, J. Tavares, and A.J. Padilha. A group block distribution strategy for a heterogeneous machine. In M. H. Hamza, editor, Applied Informatics, pages 378-383. IASTED, ACTA Press, February 2002.
5. F. Berman, R. Wolski, S. Figueira, J. Schopf, and G. Shao. Application-level scheduling on distributed heterogeneous networks. In Supercomputing 96,1996.
6. J. Blazewicz, P. Dell'Olmo, M. Drozdowski, and P. Maczka. Scheduling multiprocessor tasks on parallel processors with limited availability. European journal of Operational Research, (149):377-389, 2003.
7. J. Blazewicz, M. Machowiak, J. Weglarz, M. Kovalyov, and D. Trystram. Scheduling malleable tasks on parallel processors to minimize the makespan. Annals of Operations Research, (129):65-80, 2004.
8. V. Boudet, F. Rastello, and Y. Robert. A proposal for a heterogeneous cluster ScaLAPACK(dense linear solvers). In Proceedings of PDPTA. CSREA Press, 1999.
9. Pierre Boulet, Jack Dongarra, Fabrice Rastello, Yves Robert, and Frédéric Vivien. Algorithmic issues on heterogeneous computing platforms. Parallel Processing Letters, 9(2): 197-213, 1999.
10. J. Choi, J. Dongarra, L. S. Ostrouchov, A. P. Petitet, D. W. Walker, and R. C. Whaley. The design and implementation of the ScaLAPACK LU, QR, and CHOLESKY factorization routines. Scientific Programming, 5:173-184, 1996.
11. Sameer Shivle et al. Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment. In Heteropar'04. IEEE Computer Society, 2004.
12. R. Geijn and J. Watts. Summa: Scalable universal matrix multiplication algorithm. Technical Report CS-95-286, University of Tennessee, Knoxville, 1995.
13. A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, pages 686-701, June 1993.
14. K. Jansen. Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica, 39:59-81, 2004.
15. Y. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4) 406-471, December 1999.
16. R. Lepère, G. Mounié, and D. Trystram. An approximation algorithm for scheduling trees of malleable tasks. European journal of Operational Research, (142):242-249, 2002.
17. Oh-Heum and K-Y Chwa. Scheduling parallel tasks with individual deadlines. Theoretical Computer Science, 215:209-223, 1999.
18. Gyung-Leen Park. Performance evaluation of a list scheduling algorithm in distributed memory multiprocessor systems. Future Generation Computer Systems, (20):249-256, 2004.
19. B. Shirazi, M. Wang, and G. Pathak. Analysis and evaluation of heuristic methods for static task scheduling. Journal of Parallel and Distributing Computing, 10:222-232, 1990.
20. O. Sinnen and L. Sousa. List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Computing, (30):81-101, 2004.
21. H. Topcuoglu, S. Hariri, and M.-Y Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, March 2002.
22. Denis Trystram. Scheduling parallel applications using malleable tasks on clusters. In 15th International Conference on Parallel and Distributed Processing Symposium, 2001.