Task Replication and Scheduling Based on Nearest Neighbor Classification in Desktop Grids

Abstract

AbstractThe desktop grids are a kind of grid computing that incorporates desktop resources into grid infrastructure. In desktop grids, it is important that fast turnaround time is guaranteed in the presence of the dynamic properties such as volatility and heterogeneity. In this paper, we propose a nearest neighbor (NN)-based task scheduling that can selectively allocate tasks to those resources that are suitable for the current situation of a desktop grid environment. The experimental results show that our scheduling is more efficient than the existing scheduling with respect to reducing both turnaround time and the number of resources consumed.KeywordsTask replicationTask schedulingNearest neighbor classificationDesktop grids