Asynchronous Task Scheduling of the Fast Multipole Method Using Various Runtime Systems

Author

Bo Zhang

Author_Institution

Center for Res. in Extreme Scale Technol., Indiana Univ., Bloomington, IN, USA

fYear

2014

Firstpage

9

Lastpage

16

Abstract

In this paper, we explore data-driven execution of the adaptive fast multipole method by asynchronously scheduling available computational tasks using Cilk, C++11 standard thread and future libraries, the High Performance ParalleX (HPX-5) library, and OpenMP tasks. By comparing these implementations using various input data sets, this paper examines the runtime system´s capability to spawn new task, the capacity of the tasks that can be managed, the performance impact between eager and lazy thread creation for new task, and the effectiveness of the task scheduler and its ability to recognize the critical path of the underlying algorithm.

Keywords

parallel algorithms; scheduling; C++11 standard thread; Cilk; HPX-5 library; OpenMP task; adaptive fast multipole method; asynchronous task scheduling; eager thread creation; high performance ParalleX library; lazy thread creation; runtime system; Accuracy; Adaptation models; Computational modeling; Instruction sets; Libraries; Processor scheduling; Runtime; C++11; Cilk; Data-driven; Fast Multipole Method; HPX-5; OpenMP;

fLanguage

English

Publisher

ieee

Conference_Titel

Data-Flow Execution Models for Extreme Scale Computing (DFM), 2014 Fourth Workshop on

Type

conf

DOI

10.1109/DFM.2014.14

Filename

7089024