Fast and high quality topology-aware task mapping

Warning The system is temporarily closed to updates for reporting purpose.

Deveci, Mehmet and Kaya, Kamer and Uçar, Bora and Çatalyürek, Ümit V. (2014) Fast and high quality topology-aware task mapping. [Working Paper / Technical Report] Sabanci University ID:UNSPECIFIED

[img]PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


Considering the large number of processors and the size of the interconnection networks on exascale capable supercomputers, mapping concurrently executable and communicating tasks of an application is a complex problem that needs to be dealt with care. For parallel applications, the communication overhead can be a significant bottleneck on scalability. Topology-aware task-mapping methods that map the tasks to the processors (i.e., cores) by exploiting the underlying network information are very effective to avoid, or at worst bend, this limitation. We propose novel, efficient, and effective task mapping algorithms employing a graph model. The experiments show that the methods are faster than the existing approaches proposed for the same task, and on 4096 processors, the algorithms improve the communication hops and link contentions by 16% and 32%, respectively, on the average. In addition, they improve the average execution time of a parallel SpMV kernel and a communication-only application by 9% and 14%, respectively.

Item Type:Working Paper / Technical Report
Uncontrolled Keywords:Task mapping, communication graph, partitioning
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:24961
Deposited By:Kamer Kaya
Deposited On:05 Dec 2014 22:54
Last Modified:02 Aug 2019 11:45

Repository Staff Only: item control page