Task Replication and Scheduling Based on Nearest Neighbor Classification in Desktop Grids
The 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 replication Task scheduling Nearest neighbor classification Desktop grids
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2012R1A1A4A01015777).
- 1.SETI@Home, http://setiathome.berkeley.edu/
- 2.Anderson, D.: BOINC: A system for public-resource computing and storage. In: 5th IEEE/ACM International Workshop on Grid, Computing, pp. 4–10 (2004).Google Scholar
- 4.Korea@Home, http://koreaathome.org/eng/
- 6.Fedak, G.: Recent advances and research challenges in desktop grid and volunteer computing. Grids, P2P and Services, Computing, pp. 171–185 (2010).Google Scholar
- 7.Domingues, P., Marques, P., Silva, L.: DGSchedSim: A trace-driven simulator to evaluate scheduling algorithms for desktop grid environments. In: 14th Euromicro Internaional Conference on Parallel, Distributed, and Network-Based Processing, pp. 83–90 (2006).Google Scholar
- 9.Gil, J.-M., Park, C.Y., Jeong, Y.-S.: Adaptive result verification based on fuzzy inference model in desktop grid environments. J. Internet Technol. 13(1), 147–158 (2012)Google Scholar
- 10.Trivedi, K.S.: Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Wiley, New York (2002)Google Scholar
- 11.Shakhnarovich, G., Darrell, T., Indyk, P.: Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, Cambridge, MA (2006)Google Scholar
- 12.Okun, O.: Feature selection and ensemble methods for bioinfomatics: Algorithmic classification and implementations, IGI Global (2010).Google Scholar