TY - GEN
T1 - Multi-phased Task Placement of HPC Applications in the Cloud
AU - Carreno, Emmanuell D.
AU - Alves, Marco A.Z.
AU - Diener, Matthias
AU - Roloff, Eduardo
AU - Navaux, Philippe A.O.
N1 - Funding Information:
ACKNOWLEDGMENT This work was financed in part by the Coordenação de Aper-feiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - Many high-performance computing applications present different phases during their execution. Nevertheless, thread and process placement techniques usually provide static-only methods to improve the data and thread locality. Similarly, cloud computing datacenters may present variations in terms of latency over the execution time of applications. To overcome these two problems, in this paper we analyze scientific applications that have different communication patterns along with its execution. For such applications, we evaluate the performance variation of traditional static placement techniques to our new approach that uses code annotations to perform the new placement of tasks, matching also the variations on network performance of Virtual Machines (VMs) during the run time. For our experiments, we use applications from the NAS parallel benchmark suite, running them on two VM sizes with 32 and 64 cores respectively, from the same family of instance types at the West US datacenter from Azure. Results show that compared to traditional static process mapping, our multi-phased placement mechanism achieves average performance gains of 13.57% up to 28.32% on the evaluated scenarios. These results show that there is an opportunity to improve performance by correctly identifying the network variations and reacting by generating a new task-to-instance mapping.
AB - Many high-performance computing applications present different phases during their execution. Nevertheless, thread and process placement techniques usually provide static-only methods to improve the data and thread locality. Similarly, cloud computing datacenters may present variations in terms of latency over the execution time of applications. To overcome these two problems, in this paper we analyze scientific applications that have different communication patterns along with its execution. For such applications, we evaluate the performance variation of traditional static placement techniques to our new approach that uses code annotations to perform the new placement of tasks, matching also the variations on network performance of Virtual Machines (VMs) during the run time. For our experiments, we use applications from the NAS parallel benchmark suite, running them on two VM sizes with 32 and 64 cores respectively, from the same family of instance types at the West US datacenter from Azure. Results show that compared to traditional static process mapping, our multi-phased placement mechanism achieves average performance gains of 13.57% up to 28.32% on the evaluated scenarios. These results show that there is an opportunity to improve performance by correctly identifying the network variations and reacting by generating a new task-to-instance mapping.
KW - Cloud Computing, HPC, Task Mapping, MPI, NAS, Network Variability
UR - http://www.scopus.com/inward/record.url?scp=85071437004&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85071437004&partnerID=8YFLogxK
U2 - 10.1109/ISPDC.2019.00023
DO - 10.1109/ISPDC.2019.00023
M3 - Conference contribution
AN - SCOPUS:85071437004
T3 - Proceedings - 2019 18th International Symposium on Parallel and Distributed Computing, ISPDC 2019
SP - 103
EP - 111
BT - Proceedings - 2019 18th International Symposium on Parallel and Distributed Computing, ISPDC 2019
A2 - Iosup, Alexandru
A2 - Prodan, Radu
A2 - Uta, Alexandru
A2 - Pop, Florin
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th International Symposium on Parallel and Distributed Computing, ISPDC 2019
Y2 - 5 June 2019 through 7 June 2019
ER -