TY - GEN
T1 - Balanced scheduling algorithm considering availability in mobile grid
AU - Lee, Jonghyuk
AU - Song, Sung Jin
AU - Gil, Joonmin
AU - Chung, Kwangsik
AU - Suh, Taeweon
AU - Yu, Heonchang
PY - 2009
Y1 - 2009
N2 - The emerging Grid is extending the scope of resources to mobile devices and sensors that are connected through unreliable networks. Nowadays the number of mobile device users is increasing dramatically and the mobile devices provide various capabilities such as location awareness that are not normally incorporated in .fixed Grid resources. Nevertheless, mobile devices exhibit inferior characteristics such as poor performance, limited battery life, and unreliable communication, compared to fixed Grid resources. Therefore, the job scheduling and the load balancing are more challenging and sophisticated in mobile Grid environment. This paper presents a novel balanced scheduling algorithm in mobile Grid, taking into account the mobility and availability in scheduling. We analyzed users' mobility patterns to quantitatively measure the resource availability that is classified into three types: full availability, partial availability, and unavailability. We also propose a load balancing technique by classifying mobile devices into nine groups depending on availability. The experimental results show that our scheduling algorithm provides a superior performance in terms of execution times to one without considering availability and load-balancing.
AB - The emerging Grid is extending the scope of resources to mobile devices and sensors that are connected through unreliable networks. Nowadays the number of mobile device users is increasing dramatically and the mobile devices provide various capabilities such as location awareness that are not normally incorporated in .fixed Grid resources. Nevertheless, mobile devices exhibit inferior characteristics such as poor performance, limited battery life, and unreliable communication, compared to fixed Grid resources. Therefore, the job scheduling and the load balancing are more challenging and sophisticated in mobile Grid environment. This paper presents a novel balanced scheduling algorithm in mobile Grid, taking into account the mobility and availability in scheduling. We analyzed users' mobility patterns to quantitatively measure the resource availability that is classified into three types: full availability, partial availability, and unavailability. We also propose a load balancing technique by classifying mobile devices into nine groups depending on availability. The experimental results show that our scheduling algorithm provides a superior performance in terms of execution times to one without considering availability and load-balancing.
KW - Availability
KW - Load balancing
KW - Mobile grid
KW - scheduling
UR - http://www.scopus.com/inward/record.url?scp=67650175970&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67650175970&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-01671-4_20
DO - 10.1007/978-3-642-01671-4_20
M3 - Conference contribution
AN - SCOPUS:67650175970
SN - 9783642016707
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 211
EP - 222
BT - Advances in Grid and Pervasive Computing - 4th International Conference, GPC 2009, Proceedings
PB - Springer Verlag
T2 - 4th International Conference on Grid and Pervasive Computing, GPC 2009
Y2 - 4 May 2009 through 8 May 2009
ER -