| Title | Scheduling parallel tasks on heterogeneous clusters |
| Publication Type | Conference Paper |
| Year of Publication | 2004 |
| Authors | Barbosa, J, Morais, C, Monteiro, AP |
| Editor | T., G |
| Conference Name | Proceedings of the IASTED International Conference on Parallel and Distributed Computing and SystemsProc. IASTED INt. Conf. Parall. Distrib. Comput. Syst. |
| Date Published | 2004/// |
| Conference Location | Cambridge, MA |
| ISBN Number | 10272658 (ISSN) |
| Keywords | Computational complexity, Computer programming, CPU capacity, Data handling, Directed acyclic graphs (DAG), Graph theory, Heterogeneous clusters, Linear algebra, Parallel algorithms, Parallel processing systems, Parallel/malleable tasks, Program processors, Scheduling |
| Abstract | Parallel tasks, also called malleable tasks, are tasks that can be executed on any number of processors with its execution time being a function of the number of processors alloted to it. The scheduling of independent parallel tasks on homogeneous machines is a problem that has been extensively studied. For heterogeneous machines, with a diverse CPU capacity, new challenges arise, namely the selection of the set of CPUs that optimizes the processing time of a given task. This paper presents a methodology to determine the best allotment for each task that minimizes its processing time on a given heterogeneous machine. The aim is to improve the global processing time of a complex algorithm composed by several linear algebra kernels, by scheduling a number of parallel tasks in the heterogeneous machine. The results presented compare this approach to the simpler data parallel execution of each task on the heterogeneous cluster, i.e. executing one task at a time using the data parallel programming model. |
| URL | http://www.scopus.com/inward/record.url?eid=2-s2.0-11844282098&partnerID=40&md5=c196fdfb0cc8b4c8a37688dd289071ca |
