Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
Add to Favorite Get Latest Update

Task Mapping and Scheduling Algorithms Based on List Scheduling for Heterogeneous Computing System

Lu Xinda, Zheng Fei Department of Computer Science & Engineering, Shanghai Jiaotong University, China  
This paper describes how to carry out task mapping and scheduling in heterogeneous computing system (HCS) using list scheduling algorithms. Two kinds of static (HSP Heterogeneous Sta tic Priority and GHSP Greedy Heterogeneous Static Priority) and one dynamic (BHDP Basic Heterogeneous Dynamic Priority) heterogeneous task mapping algorithms based on priority list scheduling are presented. The testing results indicate that the scheduling effect of GHSP algorithm is better than HSP algorithm for medium and coarse grain DAG, while the scheduling effect of BHDP algorithm clearly outperforms the HSP and GHSP for both coarse and fine grain DAGs.
【Fund】: 国家自然科学基金
【CateGory Index】: TP301.6,
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved