查詢結果分析
相關文獻
頁籤選單縮合
題名 | Adaptive Dynamic Scheduling Algorithms for Mapping Ongoing M-Tasks to PR² Grid= |
---|---|
作者 | 林作俊; 施俊偉; 許致軒; Lin, Cho-chin; Shih, Chun-wei; Hsu, Chih-hsuan; |
期刊 | Journal of Information Science and Engineering |
出版日期 | 20101100 |
卷期 | 26:6 2010.11[民99.11] |
頁次 | 頁2107-2125 |
分類號 | 448.6 |
語文 | eng |
關鍵詞 | Scheduling algorithm; Grid computing; Resource redeployment; Dynamic scheduling; Model; |
英文摘要 | Grid computing provides a platform for users easily accessing worldwide distributed resources. To meet the time limit and quality requirement posted by an application running on a grid, the computing nodes allocated to the application need to be periodically redeployed. The grid which periodically redeploys computing resources to meet the needs of an ongoing application is named a PR2 grid. An M-task is a type of workflow application which performs work stage by stage. In this paper, three algorithms MaxH-LP, MaxHrLP and MaxH-rCLP are proposed for scheduling an M-task application onto the PR2 grid. The algorithms are compared with the well known algorithms Minmin and Sufferage. Our simulation results show that the average performances achieved by MaxH-rLP and MaxHrCLP outperform Minmin and Sufferage for applications of various communication computation ratios. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。