Name
Abstract | ||
|---|---|---|
As the number of cores increases in a single chip processor, several challenges arise: wire delays, contention for out-of-chip accesses, and core heterogeneity. In order to address these issues and the applications demands, future large-scale many-core processors are expected to be organized as a collection of NUMA clusters of heterogeneous cores. In this work we propose a scheduler that takes into account the non-uniform memory latency, the heterogeneity of the cores, and the contention to the memory controller to find the best matching core for the application's memory and compute requirements. Scheduler decisions are based on an on-line classification process that determines applications requirements either as memory- or compute-bound. We evaluate our proposed scheduler on the 48-core Intel SCC using applications from SPEC CPU2006 benchmark suite. Our results show that even when all cores are busy, migrating processes to cores that match better the requirements of applications results in overall performance improvement. In particular we observed a reduction of the execution time from 15% to 36% compared to a random static scheduling policy. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3078468.3078482 | SYSTOR |
Field | DocType | Citations |
Suite,Scheduling (computing),Computer science,Parallel computing,Chip,Execution time,Spec#,Memory controller,CAS latency,Performance improvement | Conference | 0 |
PageRank | References | Authors |
0.34 | 26 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Panayiotis Petrides | 1 | 12 | 3.11 |
| Pedro Trancoso | 2 | 377 | 43.79 |