跳到主要导航 跳到搜索 跳到主要内容

A credibility based scheduling algorithm for computational grid

  • Northwestern Polytechnical University Xian

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

The MCT (minimum completion time) algorithm delivers good performance. But it depends on the estimated response time too much, resulting in a low reliability. In this paper, we propose a new algorithm, which improves the MCT algorithm by adding an integrative credibility component. We evaluate our algorithm within a simulated grid environment. These experimental results show that the new credibility based MCT improves the reliability and leads to a significant performance gain.

源语言英语
主期刊名Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005
出版商IEEE Computer Society
页39
页数1
ISBN(印刷版)0769525342, 9780769525341
DOI
出版状态已出版 - 2005
活动1st International Conference on Semantics, Knowledge and Grid, SKG 2005 - Beijing, 中国
期限: 27 11月 2005 → 29 11月 2005

丛书

姓名Proceedings - First International Conference on Semantics, Knowledge and Grid, SKG 2005

会议

会议1st International Conference on Semantics, Knowledge and Grid, SKG 2005
国家/地区中国
市Beijing
时期27/11/05 → 29/11/05

学术指纹

探究 'A credibility based scheduling algorithm for computational grid' 的科研主题。它们共同构成独一无二的学术指纹。

引用此