Show simple item record

dc.contributor.authorTuncer, Ozanen_US
dc.contributor.authorZhang, Yijiaen_US
dc.contributor.authorLeung, Vitusen_US
dc.contributor.authorCoskun, Ayse K.en_US
dc.date.accessioned2018-07-19T20:18:15Z
dc.date.available2018-07-19T20:18:15Z
dc.date.issued2017-09-14
dc.identifier.citationOzan Tuncer, Yijia Zhang, Vitus Leung, AK Coskun. 2017. "Task Mapping on a Dragonfly Supercomputer." IEEE High Performance Extreme Computing Conference (HPEC). 2017-09-14
dc.identifier.urihttps://hdl.handle.net/2144/30004
dc.description.abstractThe dragonfly network topology has recently gained traction in the design of high performance computing (HPC) systems and has been implemented in large-scale supercomputers. The impact of task mapping, i.e., placement of MPI ranks onto compute cores, on the communication performance of applications on dragonfly networks has not been comprehensively investigated on real large-scale systems. This paper demonstrates that task mapping affects the communication overhead significantly in dragonflies and the magnitude of this effect is sensitive to the application, job size, and the OpenMP settings. Among the three task mapping algorithms we study (in-order, random, and recursive coordinate bisection), selecting a suitable task mapper reduces application communication time by up to 47%.en_US
dc.subjectComputer scienceen_US
dc.subjectComputer scienceen_US
dc.subjectDragonfly networken_US
dc.titleTask mapping on a dragonfly supercomputeren_US
dc.typeConference materialsen_US
pubs.elements-sourcemanual-entryen_US
pubs.notesEmbargo: No embargoen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Engineeringen_US
pubs.organisational-groupBoston University, College of Engineering, Department of Electrical & Computer Engineeringen_US
pubs.publication-statusPublisheden_US


This item appears in the following Collection(s)

Show simple item record