Name
Abstract | ||
|---|---|---|
Current shared-memory systems can feature tens of processing elements. The old assumption that coarse-grain synchronization is enough in a shared-memory system thus becomes invalid. To efficiently take advantage of such systems, we propose to use fine grain synchronization, with event-driven multithreading. To illustrate our point, we study a naive 5-point 2D stencil kernel. We provide several synchronization variants using our fine-grain multithreading environment, and compare it to a naive coarse-grain implementation using OpenMP. We conducted experiments on three different many-core compute nodes, with speedups ranging from 1.2x to 1.75x. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-52709-3_16 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Kernel (linear algebra),Multithreading,Synchronization,Computer science,Stencil,Parallel computing,Ranging | Conference | 10136 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tongsheng Geng | 1 | 0 | 0.34 |
| Stéphane Zuckerman | 2 | 42 | 8.16 |
| José Monsalve | 3 | 0 | 0.68 |
| Alfredo Goldman | 4 | 109 | 17.42 |
| Sami J. Habib | 5 | 109 | 25.48 |
| Jean-Luc Gaudiot | 6 | 938 | 121.51 |
| Guang R. Gao | 7 | 2661 | 265.87 |