Balanced scheduling algorithm considering availability in mobile grid

Jonghyuk Lee, SungJin Song, Joonmin Gil, Kwangsik Chung, Taeweon Suh, Heonchang Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages211-222
Number of pages12
Volume5529
DOIs
Publication statusPublished - 2009 Jul 15
Event4th International Conference on Grid and Pervasive Computing, GPC 2009 - Geneva, Switzerland
Duration: 2009 May 42009 May 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5529
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Grid and Pervasive Computing, GPC 2009
CountrySwitzerland
CityGeneva
Period09/5/409/5/8

Fingerprint

Scheduling algorithms
Scheduling Algorithm
Mobile devices
Mobile Devices
Availability
Grid
Load Balancing
Resource allocation
Resources
Scheduling
Location Awareness
Job Scheduling
Battery
Execution Time
Partial
Sensor
Communication
Sensors
Experimental Results

Keywords

  • Availability
  • Load balancing
  • Mobile grid
  • scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lee, J., Song, S., Gil, J., Chung, K., Suh, T., & Yu, H. (2009). Balanced scheduling algorithm considering availability in mobile grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5529, pp. 211-222). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5529). https://doi.org/10.1007/978-3-642-01671-4_20

Balanced scheduling algorithm considering availability in mobile grid. / Lee, Jonghyuk; Song, SungJin; Gil, Joonmin; Chung, Kwangsik; Suh, Taeweon; Yu, Heonchang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5529 2009. p. 211-222 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5529).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, J, Song, S, Gil, J, Chung, K, Suh, T & Yu, H 2009, Balanced scheduling algorithm considering availability in mobile grid. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5529, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5529, pp. 211-222, 4th International Conference on Grid and Pervasive Computing, GPC 2009, Geneva, Switzerland, 09/5/4. https://doi.org/10.1007/978-3-642-01671-4_20
Lee J, Song S, Gil J, Chung K, Suh T, Yu H. Balanced scheduling algorithm considering availability in mobile grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5529. 2009. p. 211-222. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-01671-4_20
Lee, Jonghyuk ; Song, SungJin ; Gil, Joonmin ; Chung, Kwangsik ; Suh, Taeweon ; Yu, Heonchang. / Balanced scheduling algorithm considering availability in mobile grid. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5529 2009. pp. 211-222 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2397aaac26c14e509cf72d7a01d9ccb9,
title = "Balanced scheduling algorithm considering availability in mobile grid",
abstract = "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.",
keywords = "Availability, Load balancing, Mobile grid, scheduling",
author = "Jonghyuk Lee and SungJin Song and Joonmin Gil and Kwangsik Chung and Taeweon Suh and Heonchang Yu",
year = "2009",
month = "7",
day = "15",
doi = "10.1007/978-3-642-01671-4_20",
language = "English",
isbn = "9783642016707",
volume = "5529",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "211--222",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Balanced scheduling algorithm considering availability in mobile grid

AU - Lee, Jonghyuk

AU - Song, SungJin

AU - Gil, Joonmin

AU - Chung, Kwangsik

AU - Suh, Taeweon

AU - Yu, Heonchang

PY - 2009/7/15

Y1 - 2009/7/15

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

VL - 5529

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 211

EP - 222

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -