An Effective Task Scheduling Method with Link Contention Constraints for Heterogeneous Computing System
碩士 === 國立交通大學 === 資訊工程系 === 91 === Sufficient and various computing resources make heterogeneous computing system suitable for parallel and distributed application. A task scheduling problem is to find the minimum schedule length by arranging tasks of application on computing resources. I...
Main Authors: | He Shuo-Zhan, 何碩展 |
---|---|
Other Authors: | Cheng Chen |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/83751815029828870092 |
Similar Items
-
An Effective Duplication-based Task Scheduling Algorithm with Link Contention Constraints for Heterogeneous Computing System
by: Hsu Shun-Min, et al.
Published: (2004) -
Static Task Scheduling for Heterogeneous Distributed Computing Systems with Memory Constraints
by: Chang-ChihLiu, et al.
Published: (2010) -
Energy-Aware Task Scheduling on Heterogeneous Computing Systems With Time Constraint
by: Zexi Deng, et al.
Published: (2020-01-01) -
Dynamic Task Scheduling Algorithm with Deadline Constraint in Heterogeneous Volunteer Computing Platforms
by: Ling Xu, et al.
Published: (2019-05-01) -
Task Matching and Scheduling in Heterogeneous Computing Systems
by: Wei Chia-Hsin, et al.
Published: (2001)