A scheduling algorithm with dynamic properties in mobile grid

JongHyuk H. Lee, SungJin J. Choi, JoonMin M. Gil, Taeweon Suh, Heonchang Yu

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Mobile grid is a branch of grid computing that incorporates mobile devices into the grid infrastructure. It poses new challenges because mobile devices are typically resource-constrained and exhibit unique characteristics such as instability in network connections. New scheduling strategies are imperative in mobile grid to efficiently utilize the devices. This paper presents a scheduling algorithm that considers dynamic properties of mobile devices such as availability, reliability, maintainability, and usage pattern in mobile grid environments. In particular, usage patterns caused by voluntarily or involuntarily losing a connection, such as switching off the device or a network interruption could be important criteria for choosing the best resource to execute a job. The experimental results show that our scheduling algorithm provides superior performance in terms of execution time, as compared to the other methods that do not consider usage pattern. Throughout the experiments, we found it essential to consider usage pattern for improving performance in the mobile grid.

Original languageEnglish
Pages (from-to)847-857
Number of pages11
JournalFrontiers of Computer Science
Volume8
Issue number5
DOIs
Publication statusPublished - 2014 Oct 31

Fingerprint

Dynamic Properties
Scheduling algorithms
Scheduling Algorithm
Mobile devices
Grid
Mobile Devices
Grid computing
Maintainability
Scheduling
Resources
Availability
Grid Computing
Execution Time
Branch
Infrastructure
Experiments
Experimental Results
Experiment

Keywords

  • availability
  • dynamic properties
  • maintainability
  • mobile grid
  • reliability
  • scheduling
  • usage pattern

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

A scheduling algorithm with dynamic properties in mobile grid. / Lee, JongHyuk H.; Choi, SungJin J.; Gil, JoonMin M.; Suh, Taeweon; Yu, Heonchang.

In: Frontiers of Computer Science, Vol. 8, No. 5, 31.10.2014, p. 847-857.

Research output: Contribution to journalArticle

Lee, JongHyuk H. ; Choi, SungJin J. ; Gil, JoonMin M. ; Suh, Taeweon ; Yu, Heonchang. / A scheduling algorithm with dynamic properties in mobile grid. In: Frontiers of Computer Science. 2014 ; Vol. 8, No. 5. pp. 847-857.
@article{c01ee5ae663d4ee39bfbf62d041fa7ab,
title = "A scheduling algorithm with dynamic properties in mobile grid",
abstract = "Mobile grid is a branch of grid computing that incorporates mobile devices into the grid infrastructure. It poses new challenges because mobile devices are typically resource-constrained and exhibit unique characteristics such as instability in network connections. New scheduling strategies are imperative in mobile grid to efficiently utilize the devices. This paper presents a scheduling algorithm that considers dynamic properties of mobile devices such as availability, reliability, maintainability, and usage pattern in mobile grid environments. In particular, usage patterns caused by voluntarily or involuntarily losing a connection, such as switching off the device or a network interruption could be important criteria for choosing the best resource to execute a job. The experimental results show that our scheduling algorithm provides superior performance in terms of execution time, as compared to the other methods that do not consider usage pattern. Throughout the experiments, we found it essential to consider usage pattern for improving performance in the mobile grid.",
keywords = "availability, dynamic properties, maintainability, mobile grid, reliability, scheduling, usage pattern",
author = "Lee, {JongHyuk H.} and Choi, {SungJin J.} and Gil, {JoonMin M.} and Taeweon Suh and Heonchang Yu",
year = "2014",
month = "10",
day = "31",
doi = "10.1007/s11704-014-3223-6",
language = "English",
volume = "8",
pages = "847--857",
journal = "Frontiers of Computer Science",
issn = "2095-2228",
publisher = "Springer Science + Business Media",
number = "5",

}

TY - JOUR

T1 - A scheduling algorithm with dynamic properties in mobile grid

AU - Lee, JongHyuk H.

AU - Choi, SungJin J.

AU - Gil, JoonMin M.

AU - Suh, Taeweon

AU - Yu, Heonchang

PY - 2014/10/31

Y1 - 2014/10/31

N2 - Mobile grid is a branch of grid computing that incorporates mobile devices into the grid infrastructure. It poses new challenges because mobile devices are typically resource-constrained and exhibit unique characteristics such as instability in network connections. New scheduling strategies are imperative in mobile grid to efficiently utilize the devices. This paper presents a scheduling algorithm that considers dynamic properties of mobile devices such as availability, reliability, maintainability, and usage pattern in mobile grid environments. In particular, usage patterns caused by voluntarily or involuntarily losing a connection, such as switching off the device or a network interruption could be important criteria for choosing the best resource to execute a job. The experimental results show that our scheduling algorithm provides superior performance in terms of execution time, as compared to the other methods that do not consider usage pattern. Throughout the experiments, we found it essential to consider usage pattern for improving performance in the mobile grid.

AB - Mobile grid is a branch of grid computing that incorporates mobile devices into the grid infrastructure. It poses new challenges because mobile devices are typically resource-constrained and exhibit unique characteristics such as instability in network connections. New scheduling strategies are imperative in mobile grid to efficiently utilize the devices. This paper presents a scheduling algorithm that considers dynamic properties of mobile devices such as availability, reliability, maintainability, and usage pattern in mobile grid environments. In particular, usage patterns caused by voluntarily or involuntarily losing a connection, such as switching off the device or a network interruption could be important criteria for choosing the best resource to execute a job. The experimental results show that our scheduling algorithm provides superior performance in terms of execution time, as compared to the other methods that do not consider usage pattern. Throughout the experiments, we found it essential to consider usage pattern for improving performance in the mobile grid.

KW - availability

KW - dynamic properties

KW - maintainability

KW - mobile grid

KW - reliability

KW - scheduling

KW - usage pattern

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

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

U2 - 10.1007/s11704-014-3223-6

DO - 10.1007/s11704-014-3223-6

M3 - Article

VL - 8

SP - 847

EP - 857

JO - Frontiers of Computer Science

JF - Frontiers of Computer Science

SN - 2095-2228

IS - 5

ER -