An Efficient Scheduling Algorithm for GPU-Attached Computing Systems

碩士 === 國立宜蘭大學 === 電子工程學系碩士班 === 100 === H system is a computing system which consists of processing cores built in the CPUs of the system and attached processing devices such as GPUs. A complex task always has a tremendous computation need and it progresses by alternately performing work segments of...

Full description

Bibliographic Details
Main Authors: Chien-Chen Lai, 賴建臣
Other Authors: Cho-Chin Lin
Format: Others
Language:zh-TW
Published: 2011
Online Access:http://ndltd.ncl.edu.tw/handle/50066465668284478784
id ndltd-TW-100NIU07428002
record_format oai_dc
spelling ndltd-TW-100NIU074280022015-10-13T20:37:07Z http://ndltd.ncl.edu.tw/handle/50066465668284478784 An Efficient Scheduling Algorithm for GPU-Attached Computing Systems 適用於具圖形處理器的運算系統之有效排程演算法 Chien-Chen Lai 賴建臣 碩士 國立宜蘭大學 電子工程學系碩士班 100 H system is a computing system which consists of processing cores built in the CPUs of the system and attached processing devices such as GPUs. A complex task always has a tremendous computation need and it progresses by alternately performing work segments of different computation characteristics. In this thesis, an algorithm has been proposed for scheduling complex tasks to H system such that the device computing facilities can be effectively utilized. Our algorithm assigns priorities to complex tasks before mapping them to the cores of H system, and to reduce the amount of time all tasks need to spend in H system. The simulation has demonstrated that our algorithm is efficient than FFR algorithms for scheduling complex tasks to H system under various numbers of cores, and have obtained speedups as high as 19.4% on average compared to using FFR algorithm to scheduling tasks. Cho-Chin Lin 林作俊 2011 學位論文 ; thesis 66 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立宜蘭大學 === 電子工程學系碩士班 === 100 === H system is a computing system which consists of processing cores built in the CPUs of the system and attached processing devices such as GPUs. A complex task always has a tremendous computation need and it progresses by alternately performing work segments of different computation characteristics. In this thesis, an algorithm has been proposed for scheduling complex tasks to H system such that the device computing facilities can be effectively utilized. Our algorithm assigns priorities to complex tasks before mapping them to the cores of H system, and to reduce the amount of time all tasks need to spend in H system. The simulation has demonstrated that our algorithm is efficient than FFR algorithms for scheduling complex tasks to H system under various numbers of cores, and have obtained speedups as high as 19.4% on average compared to using FFR algorithm to scheduling tasks.
author2 Cho-Chin Lin
author_facet Cho-Chin Lin
Chien-Chen Lai
賴建臣
author Chien-Chen Lai
賴建臣
spellingShingle Chien-Chen Lai
賴建臣
An Efficient Scheduling Algorithm for GPU-Attached Computing Systems
author_sort Chien-Chen Lai
title An Efficient Scheduling Algorithm for GPU-Attached Computing Systems
title_short An Efficient Scheduling Algorithm for GPU-Attached Computing Systems
title_full An Efficient Scheduling Algorithm for GPU-Attached Computing Systems
title_fullStr An Efficient Scheduling Algorithm for GPU-Attached Computing Systems
title_full_unstemmed An Efficient Scheduling Algorithm for GPU-Attached Computing Systems
title_sort efficient scheduling algorithm for gpu-attached computing systems
publishDate 2011
url http://ndltd.ncl.edu.tw/handle/50066465668284478784
work_keys_str_mv AT chienchenlai anefficientschedulingalgorithmforgpuattachedcomputingsystems
AT làijiànchén anefficientschedulingalgorithmforgpuattachedcomputingsystems
AT chienchenlai shìyòngyújùtúxíngchùlǐqìdeyùnsuànxìtǒngzhīyǒuxiàopáichéngyǎnsuànfǎ
AT làijiànchén shìyòngyújùtúxíngchùlǐqìdeyùnsuànxìtǒngzhīyǒuxiàopáichéngyǎnsuànfǎ
AT chienchenlai efficientschedulingalgorithmforgpuattachedcomputingsystems
AT làijiànchén efficientschedulingalgorithmforgpuattachedcomputingsystems
_version_ 1718049320453799936