Publications
Detailed Information
Scheduling Algorithms for Parallel Real-Time Tasks with Multiple Parallelization Options on Multicore/GPGPU System : 멀티코어/GPGPU 시스템 상에서 복수 병렬화 옵션을 가지는 병렬 실시간 태스크 스케줄링 방법
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- 이창건
- Major
- 공과대학 전기·컴퓨터공학부
- Issue Date
- 2014-08
- Publisher
- 서울대학교 대학원
- Keywords
- parallelization ; multicore ; gpgpu ; real-time ; scheduling
- Description
- 학위논문 (석사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2014. 8. 이창건.
- Abstract
- Past researches on multicore/GPGPU scheduling assume that a computational unit has a pre-fixed number of CPU and GPU threads. However, with recent technologies such as OpenCL, a computational unit can be parallelized in many different ways with runtime selectable numbers of CPU and GPU threads. This paper proposes algorithms for optimally parallelizing and scheduling a set of parallel tasks with multiple parallelization options on multiple CPU cores and multiple GPU devices. Our experimental study says that the proposed algorithms can successfully schedule up to two times more tasks compared with other algorithms assuming pre-fixed parallelization. To the best of our knowledge, this is the first work addressing the problem of scheduling parallel tasks with multiple parallelization options on multiple heterogeneous resources.
- Language
- English
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.