A Study of Dynamic Loop Scheduling Algorithms on Modern Manycore Architectures

Prof. Dr. Florina Ciorba, Universität Basel

20 Feb 2017, 16:30–18:00; Location: S2|02-C110

High performance computing (HPC) systems are nowadays large, consist of diverse components, and exhibit massive parallelism. Exploiting the available hardware parallelism is notoriously challenging, in part due to difficulty in exposing and expressing parallelism in the computational applications. Loops are considered the main source of parallelism in most scientific computational applications. Dynamic loop scheduling (DLS) algorithms are used to parallelize scientific applications and achieve optimized execution performance.

In this talk we examine the effect of two different parallel programming models (multithreaded and message-passing) on the performance of four well-known DLS algorithms: static chunking (STATIC), self service (SS), guided self scheduling (GSS), and factoring (FAC). Three different parallel programming libraries (Pthreads, OpenMP, and OpenMPI) are exploited for parallelizing matrix multiplication and adjoint convolution on the Intel Xeon Phi Knights Landing (KNL) architecture.

Category: CE Seminar


Technische Universität Darmstadt

Graduate School CE
Dolivostraße 15
D-64293 Darmstadt

Phone+49 6151/16-24401
Fax -24404

to assistants' office

Open BSc/MSc Theses

Show a list of open BSc/MSc topics at GSC CE.

 Print |  Impressum |  Sitemap |  Search |  Contact |  Privacy Policy
zum Seitenanfangzum Seitenanfang