Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10330624 | Future Generation Computer Systems | 2013 | 14 Pages |
Abstract
⺠We introduce a decentralized scheduling algorithm without requiring detailed node information. ⺠Our algorithm is able to adapt to the changes in grids through time by rescheduling. ⺠Comparisons with the known BestFit algorithm within a centralized scheduling scheme are made. ⺠Our algorithm leads to a 30%-61% better average job slowdown. ⺠Our algorithm leads to a 68%-86% shorter average job waiting time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ye Huang, Nik Bessis, Peter Norrington, Pierre Kuonen, Beat Hirsbrunner,