An effective and robust two-phase resource allocation scheme for interdependent tasks in mobile ad hoc computational Grids

Sayed Chhattan Shah, Qurat Ul Ain Nizamani, Sajjad Hussain Chauhdary, Myong Soon Park

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational Grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc Grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational Grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure. In this paper, we propose a two-phase resource allocation scheme to reduce communication cost between dependent tasks. The scheme is divided into two phases. The first phase exploits the history of user mobility patterns to select nodes that provide long-term connectivity and the second phase takes into account the task and dependency types, and uses the distance information among the nodes selected in the first phase to reduce communication costs. The scheme is validated in a simulation environment using various workloads and parameters.

Original languageEnglish
Pages (from-to)1664-1679
Number of pages16
JournalJournal of Parallel and Distributed Computing
Volume72
Issue number12
DOIs
Publication statusPublished - 2012 Dec 1

Fingerprint

Computational Grid
Communication Cost
Resource Allocation
Resource allocation
Communication
Vertex of a graph
Connectivity
Costs
Dependent
Data Transfer
Multi-hop
Simulation Environment
Workload
Activation
Infrastructure
Grid
Imply
Data transfer
Chemical activation

Keywords

  • Ad hoc networks
  • Computational Grid
  • Mobile Grids
  • Resource allocation
  • Task dependencies

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Theoretical Computer Science

Cite this

An effective and robust two-phase resource allocation scheme for interdependent tasks in mobile ad hoc computational Grids. / Shah, Sayed Chhattan; Nizamani, Qurat Ul Ain; Chauhdary, Sajjad Hussain; Park, Myong Soon.

In: Journal of Parallel and Distributed Computing, Vol. 72, No. 12, 01.12.2012, p. 1664-1679.

Research output: Contribution to journalArticle

@article{2670ec8c02d64adea1638f63dd821fb2,
title = "An effective and robust two-phase resource allocation scheme for interdependent tasks in mobile ad hoc computational Grids",
abstract = "This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational Grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc Grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational Grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure. In this paper, we propose a two-phase resource allocation scheme to reduce communication cost between dependent tasks. The scheme is divided into two phases. The first phase exploits the history of user mobility patterns to select nodes that provide long-term connectivity and the second phase takes into account the task and dependency types, and uses the distance information among the nodes selected in the first phase to reduce communication costs. The scheme is validated in a simulation environment using various workloads and parameters.",
keywords = "Ad hoc networks, Computational Grid, Mobile Grids, Resource allocation, Task dependencies",
author = "Shah, {Sayed Chhattan} and Nizamani, {Qurat Ul Ain} and Chauhdary, {Sajjad Hussain} and Park, {Myong Soon}",
year = "2012",
month = "12",
day = "1",
doi = "10.1016/j.jpdc.2012.07.012",
language = "English",
volume = "72",
pages = "1664--1679",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "12",

}

TY - JOUR

T1 - An effective and robust two-phase resource allocation scheme for interdependent tasks in mobile ad hoc computational Grids

AU - Shah, Sayed Chhattan

AU - Nizamani, Qurat Ul Ain

AU - Chauhdary, Sajjad Hussain

AU - Park, Myong Soon

PY - 2012/12/1

Y1 - 2012/12/1

N2 - This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational Grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc Grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational Grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure. In this paper, we propose a two-phase resource allocation scheme to reduce communication cost between dependent tasks. The scheme is divided into two phases. The first phase exploits the history of user mobility patterns to select nodes that provide long-term connectivity and the second phase takes into account the task and dependency types, and uses the distance information among the nodes selected in the first phase to reduce communication costs. The scheme is validated in a simulation environment using various workloads and parameters.

AB - This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational Grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc Grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational Grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure. In this paper, we propose a two-phase resource allocation scheme to reduce communication cost between dependent tasks. The scheme is divided into two phases. The first phase exploits the history of user mobility patterns to select nodes that provide long-term connectivity and the second phase takes into account the task and dependency types, and uses the distance information among the nodes selected in the first phase to reduce communication costs. The scheme is validated in a simulation environment using various workloads and parameters.

KW - Ad hoc networks

KW - Computational Grid

KW - Mobile Grids

KW - Resource allocation

KW - Task dependencies

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

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

U2 - 10.1016/j.jpdc.2012.07.012

DO - 10.1016/j.jpdc.2012.07.012

M3 - Article

AN - SCOPUS:84867886664

VL - 72

SP - 1664

EP - 1679

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 12

ER -