Group-based scheduling algorithm for fault tolerance in mobile grid

JongHyuk Lee, SungJin Choi, Taeweon Suh, Heonchang Yu, JoonMin Gil

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

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationCommunications in Computer and Information Science
Pages394-403
Number of pages10
Volume78 CCIS
DOIs
Publication statusPublished - 2010 Nov 8
Event1st International Conference on Security-Enriched Urban Computing and Smart Grid, SUComS 2010 - Daejeon, Korea, Republic of
Duration: 2010 Sep 152010 Sep 17

Publication series

NameCommunications in Computer and Information Science
Volume78 CCIS
ISSN (Print)18650929

Other

Other1st International Conference on Security-Enriched Urban Computing and Smart Grid, SUComS 2010
CountryKorea, Republic of
CityDaejeon
Period10/9/1510/9/17

Fingerprint

Fault tolerance
Scheduling algorithms
Mobile devices
Grid computing
Adaptive algorithms
Scheduling
Experiments

Keywords

  • mobile Grid
  • replication
  • scheduling algorithm

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

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

Group-based scheduling algorithm for fault tolerance in mobile grid. / Lee, JongHyuk; Choi, SungJin; Suh, Taeweon; Yu, Heonchang; Gil, JoonMin.

Communications in Computer and Information Science. Vol. 78 CCIS 2010. p. 394-403 (Communications in Computer and Information Science; Vol. 78 CCIS).

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

Lee, J, Choi, S, Suh, T, Yu, H & Gil, J 2010, Group-based scheduling algorithm for fault tolerance in mobile grid. in Communications in Computer and Information Science. vol. 78 CCIS, Communications in Computer and Information Science, vol. 78 CCIS, pp. 394-403, 1st International Conference on Security-Enriched Urban Computing and Smart Grid, SUComS 2010, Daejeon, Korea, Republic of, 10/9/15. https://doi.org/10.1007/978-3-642-16444-6_49
Lee J, Choi S, Suh T, Yu H, Gil J. Group-based scheduling algorithm for fault tolerance in mobile grid. In Communications in Computer and Information Science. Vol. 78 CCIS. 2010. p. 394-403. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-16444-6_49
Lee, JongHyuk ; Choi, SungJin ; Suh, Taeweon ; Yu, Heonchang ; Gil, JoonMin. / Group-based scheduling algorithm for fault tolerance in mobile grid. Communications in Computer and Information Science. Vol. 78 CCIS 2010. pp. 394-403 (Communications in Computer and Information Science).
@inproceedings{ec6ec0e4b8374353854c6f0440f9b43d,
title = "Group-based scheduling algorithm for fault tolerance in mobile grid",
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.",
keywords = "mobile Grid, replication, scheduling algorithm",
author = "JongHyuk Lee and SungJin Choi and Taeweon Suh and Heonchang Yu and JoonMin Gil",
year = "2010",
month = "11",
day = "8",
doi = "10.1007/978-3-642-16444-6_49",
language = "English",
isbn = "3642164439",
volume = "78 CCIS",
series = "Communications in Computer and Information Science",
pages = "394--403",
booktitle = "Communications in Computer and Information Science",

}

TY - GEN

T1 - Group-based scheduling algorithm for fault tolerance in mobile grid

AU - Lee, JongHyuk

AU - Choi, SungJin

AU - Suh, Taeweon

AU - Yu, Heonchang

AU - Gil, JoonMin

PY - 2010/11/8

Y1 - 2010/11/8

N2 - 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.

AB - 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.

KW - mobile Grid

KW - replication

KW - scheduling algorithm

UR - http://www.scopus.com/inward/record.url?scp=78049401470&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049401470&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16444-6_49

DO - 10.1007/978-3-642-16444-6_49

M3 - Conference contribution

SN - 3642164439

SN - 9783642164439

VL - 78 CCIS

T3 - Communications in Computer and Information Science

SP - 394

EP - 403

BT - Communications in Computer and Information Science

ER -