A Study of Dynamic Loop Scheduling Algorithms on Modern Manycore Architectures

  Diesen Termin in den persönlichen Kalender (z.B. Outlook, Thunderbird, Lotus Notes) übernehmen
Startdatum:20. Februar 2017
Startzeit:16:30 Uhr
Stoppzeit:17:15 Uhr
Veranstalter:Scientific Computing
Referent:Prof. Dr. Florina Ciorba, High-Performance Computing Group, Dept. of Computer Science, Universität Basel
Ort:S2 02|C110
Beschreibung:

Abstract:

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.




Kontakt

Öffentlichkeitsarbeit

S2|02
Hochschulstraße 10
64289 Darmstadt

+49 6151 16-25501
kommunikation(a-t)informatik.tu-darmstadt.de

Hinweise auf weitere lokale Veranstaltungen des Fachbereichs können an events@informatik... gesendet werden.

A A A | Drucken Drucken | Impressum Impressum | Sitemap Sitemap | Suche Suche | Kontakt Kontakt | Webseitenanalyse: Mehr Informationen
zum Seitenanfangzum Seitenanfang