Group-based scheduling algorithm for fault tolerance in mobile grid

6Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mobile Grid is a branch of Grid computing where the infrastructure includes mobile devices. Because mobile devices are resource-constrained, mobile Grid should provide new scheduling strategies considering its environment. This paper presents a group-based fault tolerance scheduling algorithm. The algorithm classifies mobile devices into several groups considering characteristic parameters of mobile Grid. Then, it uses an adaptive replication algorithm for enduring faults in an active manner. The experimental results show that our scheduling algorithm provides a superior performance in terms of execution times to the one without considering grouping and fault tolerance. Throughout the experiments, we found that the active fault tolerance (i.e., replication) is essential to improving performance in mobile Grid. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Lee, J. H., Choi, S. J., Suh, T., Yu, H. C., & Gil, J. M. (2010). Group-based scheduling algorithm for fault tolerance in mobile grid. In Communications in Computer and Information Science (Vol. 78 CCIS, pp. 394–403). https://doi.org/10.1007/978-3-642-16444-6_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free