Name
Abstract | ||
|---|---|---|
This paper proposes a thread scheduling mechanism primed for heterogeneously configured multicore systems. Our approach considers CPU utilization for mapping running threads with the appropriate core that can potentially deliver the actual needed capacity. The paper also introduces a mapping algorithm that is able to map threads to cores in an O(NlogM) time complexity, where N is the number of cores and M is the number of types of cores. In addition to that we also introduced a method of profiling heterogeneous architectures based on the discrepancy between the performances of individual cores. Our heterogeneity aware scheduler was able to speed up processing by 52.62% and save power by 2.22% as compared to the CFS scheduler that is a default in Linux systems. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1155/2017/3021565 | MOBILE INFORMATION SYSTEMS |
Field | DocType | Volume |
Thread mapping,Profiling (computer programming),Computer science,CPU time,Internet of Things,Thread (computing),Time complexity,Multi-core processor,Embedded system,Speedup,Distributed computing | Journal | 2017 |
ISSN | Citations | PageRank |
1574-017X | 1 | 0.34 |
References | Authors | |
3 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Mezmur Birhanu | 1 | 1 | 0.34 |
| Zhetao Li | 2 | 419 | 38.45 |
| Hiroo Sekiya | 3 | 261 | 44.66 |
| Nobuyoshi Komuro | 4 | 60 | 10.11 |
| Young-June Choi | 5 | 215 | 23.16 |