repository
Efficient Thread Mapping For Heterogeneous Multi-Core Systems
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Young June Choi | - |
| dc.contributor.author | THOMAS MEZMUR BIRHANU | - |
| dc.date.accessioned | 2018-11-08T08:16:03Z | - |
| dc.date.available | 2018-11-08T08:16:03Z | - |
| dc.date.issued | 2016-02 | - |
| dc.identifier.other | 21934 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/12062 | - |
| dc.description | 학위논문(석사)--아주대학교 일반대학원 :컴퓨터공학과,2016. 2 | - |
| dc.description.tableofcontents | 1 Introduction 1 2 Literature Review 4 3 Methodology 6 3.1 Assumptions 6 3.2 Heterogeneity Measure 6 3.3 Fastest-Thread-Fastest-Core Scheduler 7 3.3.1 Homogenization 8 3.3.2 Normalization 9 4 Results 13 4.1 ESESC Simulator 13 4.2 Experimentation 14 5 Conclusion 19 | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | Efficient Thread Mapping For Heterogeneous Multi-Core Systems | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.department | 일반대학원 컴퓨터공학과 | - |
| dc.date.awarded | 2016. 2 | - |
| dc.description.degree | Master | - |
| dc.identifier.localId | 739399 | - |
| dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000021934 | - |
| dc.subject.keyword | Computer Engineering | - |
| dc.description.alternativeAbstract | This paper proposes a thread scheduling mechanism primed for heterogeneously configured multicore systems. Our approach uses a relativistic sense of mapping running threads CPU utilization 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 speedup processing by 52.62% and save power by 2.22% as compared to Linux’s default CFS scheduler. | - |
- Appears in Collections:
- Graduate School of Ajou University > Department of Computer Engineering > 3. Theses(Master)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :3,736,654
- Total Download :1,818
- Today View :14,312
