Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters

Author

Dummler, J. ; Rauber, Thomas ; Runger, G.

Author_Institution

Dept. of Comput. Sci., Chemnitz Univ. of Technol., Chemnitz

fYear

2008

fDate

9-12 Sept. 2008

Firstpage

141

Lastpage

148

Abstract

In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems.These systems often have hierarchically structured interconnection networks combining different computing resources, starting with the interconnect within multi-core processors up to the interconnection network combining nodes of the cluster or supercomputer. M-task programs can support the effective use of the computing resources by adapting the task structure of the program to the hierarchical organization of the cluster system and by exploiting the available data parallelism within the M-tasks. In particular, we consider different mapping algorithms for M-tasks and investigate the resulting efficiency and scalability. We present experimental results for different application programs and different multi-core systems.

Keywords

multiprocessing systems; multiprocessor interconnection networks; M-task program; interconnection network; mapping algorithm; multicore cluster system; multiprocessor task; Chemical technology; Clustering algorithms; Computer networks; Computer science; Concurrent computing; Multicore processing; Multiprocessor interconnection networks; Parallel processing; Parallel programming; Scalability; Multi-core systems; Scalability; mixed task and data parallelism;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing, 2008. ICPP '08. 37th International Conference on

Conference_Location

Portland, OR

ISSN

0190-3918

Print_ISBN

978-0-7695-3374-2

Electronic_ISBN

0190-3918

Type

conf

DOI

10.1109/ICPP.2008.42

Filename

4625843