Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm

► 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.