کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
432848 | 689089 | 2010 | 10 صفحه PDF | دانلود رایگان |
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the resources of a Desktop Grid, it is necessary to use scheduling policies suitable for such systems. In this paper, we analyze the performance of a policy which is shown to perform well in highly heterogeneous Desktop Grids. The policy utilizes the solution to a linear programming (LP) problem which maximizes system capacity. We suggest robust modifications to address several limitations of the policy.
Research highlights
► Scalable scheduling algorithm for Desktop Grids.
► Volatile resources incorporated in capacity planning LP.
► Robust modifications result from actual deployment.
Journal: Journal of Parallel and Distributed Computing - Volume 70, Issue 12, December 2010, Pages 1231–1240