Name
Abstract | ||
|---|---|---|
Co-scheduling is known to optimize the utilization of supercomputers. By choosing applications with distict resource demands, the application throughput can be increased avoiding an underutilization of the available nodes. This is especially true for traditional multi-core architecture where a subset of the available cores are already able to saturate the main memory bandwidth. In this paper, we apply this concept to upcoming many-core architectures by taking the example of the Intel KNL. Therefore, we take a memory-bound and a compute-bound kernel from the NPB as example applications. Furthermore, we examine the effect of different memory assignment strategies that are enabled by the two-layered memory hierarchy of the KNL. |
Year | Venue | Field |
|---|---|---|
2017 | COSH/VisorHPC@HiPEAC | Kernel (linear algebra),Architecture,Memory hierarchy,Memory bandwidth,Co scheduling,Efficient energy use,Computer science,Parallel computing,Real-time computing,Throughput |
DocType | Citations | PageRank |
Conference | 1 | 0.37 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon Pickartz | 1 | 23 | 6.06 |
| Jens Breitbart | 2 | 17 | 5.22 |
| Stefan Lankes | 3 | 152 | 26.39 |