A realistic model and an efficient heuristic for scheduling with heterogeneous processors

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 88-101

  Beaumont, O ^a   Boudet, V ^a   Robert, Y ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966526461     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1015663     Document Type: Conference Paper

References (27)

1. B.A.Shirazi, A. Hurson, and K. Kavi. Scheduling and load balancing in parallel and distributed systems. IEEE Computer Science Press, 1995.
2. V. Boudet, F. Rastello, and Y. Robert. A proposal for a heterogeneous cluster ScaLAPACK (dense linear solvers). In H. R. Arabnia, editor, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99). CSREA Press, 1999. Extended version available as LIP Technical Report RR-99-17.
3. V. Boudet and Y. Robert. Scheduling heuristics for heterogeneous processors. In 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2001), pages 2109-2115. CSREA Press, 2001. Extended version available (on the Web) as Technical Report 2001-22, LIP, ENS Lyon.
4. P. Chrétienne, E. C. Jr., J. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley and Sons, 1995.
5. M. Cosnard, M. Marrakchi, Y. Robert, and D. Trystram. Parallel Gaussian elimination on a MIMD computer. Parallel Computing, 6:275-296, 1988.
6. D. E. Culler and J. P. Singh. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, San Francisco, CA, 1999.
7. A. Darte, Y. Robert, and F.Vivien. Scheduling and Automatic Parallelization. Birkhaüser, 2000.
8. H. El-Rewini, H. Ali, and T. Lewis. Task scheduling in multiprocessing systems. Computer, 28(12):27-37, 1995.
9. M. R. Garey and D. S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1991.
10. A. Gerasoulis and T. Yang. A comparison of clustering heuristics for scheduling DAGs on multiprocessors. J. Parallel and Distributed computing, 16(4):276-291, Dec. 1992.
11. A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Trans. Parallel and Distributed Systems, 4(6):686-701, 1993.
12. G. H. Golub and C. F. V. Loan. Matrix computations. Johns Hopkins, 1989.
13. L. Hollermann, T. Hsu, D. Lopez, and K. Vertanen. Scheduling problems in a practial allocation model. J. Combinatorial Optimization, 1(2):129-149, 1997.
14. T. Hsu, J. C. Lee, D. Lopez, and W. Royce. Task allocation on a network of processors. IEEE Trans. Computers, 49(12):1339-1353, 2000.
15. K. Hwang and Z. Xu. Scalable Parallel Computing. McGraw-Hill, 1998.
16. M. Maheswaran and H. J. Siegel. A dynamic matching and scheduling algorithm for heterogeneous computing systems. In Seventh Heterogeneous Computing Workshop. IEEE Computer Society Press, 1998.
17. M. Norman and P. Thanisch. Models of machines and computation for mapping in multicomputers. ACM Computing Surveys, 25(3):103-117, 1993.
18. H. Oh and S. Ha. A static scheduling heuristic for heterogeneous processors. In Proceedings of Europar'96, volume 1123 of LNCS, Lyon, France, Aug. 1996. Springer Verlag.
19. J. Orduna, F. Silla, and J. Duato. A new task mapping technique for communication-aware scheduling strategies. In T. Pinkston, editor, Workshop for Scheduling and Resource Management for Cluster Computing (ICPP'01), pages 349-354. IEEE Computer Society, 2001.
20. C. Roig, A. Ripoll, M. Senar, F. Guirado, and E. Luque. Improving static scheduling using inter-task concurrency measures. In T. Pinkston, editor, Workshop for Scheduling and Resource Management for Cluster Computing (ICPP'01), pages 375-381. IEEE Computer Society, 2001.
21. G. Sih and E. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems, 4(2):175-187, 1993.
22. O. Sinnen and L. Sousa. Comparison of contention-aware list scheduling heuristics for cluster computing. In T. Pinkston, editor, Workshop for Scheduling and Resource Management for Cluster Computing (ICPP'01), pages 382-387. IEEE Computer Society, 2001.
23. O. Sinnen and L. Sousa. Exploiting unused time-slots in list scheduling considering communication contention. In R. Sakellariou, J. Keane, J. Gurd, and L. Freeman, editors, EuroPar'2001 Parallel Processing, pages 166-170. Springer-Verlag LNCS 2150, 2001.
24. O. Sinnen and L. Sousa. Scheduling task graphs on arbitrary processor architectures considering contention. In High Performance Computing and Networking, pages 373-382. Springer-Verlag LNCS 2110, 2001.
25. M. Tan, H. Siegel, J. Antonio, and Y. Li. Minimizing the aplication execution time through scheduling of subtasks and communication traffic in a heterogeneous computing system. IEEE Transactions on Parallel and Distributed Systems, 8(4):857-1871, 1997.
26. H. Topcuoglu, S. Hariri, and M.-Y. Wu. Task scheduling algorithms for heterogeneous processors. In Eighth Heterogeneous Computing Workshop. IEEE Computer Society Press, 1999.
27. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel and Distributed Systems, 5(9):951-967, 1994.