Efficient Thread Mapping For Heterogeneous Multi-Core Systems
- 주제(키워드) Computer Engineering
- 발행기관 아주대학교
- 지도교수 Young June Choi
- 발행년도 2016
- 학위수여년월 2016. 2
- 학위명 석사
- 학과 및 전공 일반대학원 컴퓨터공학과
- 실제URI http://www.dcollection.net/handler/ajou/000000021934
- 본문언어 영어
- 저작권 아주대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
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.
more목차
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
