An adaptive and distance-based resource allocation scheme for interdependent tasks in mobile ad hoc computational grids

Sayed Chhattan Shah, Myong Soon Park, Wan Sik Choi, Zeeshan Hameed Mir, Sajjad Hussain Chauhdary, Ali Kashif Bashir, Fida Hussain Chandio

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers between tasks residing on separate nodes. The communication is always expensive and unreliable in mobile ad hoc Grids and therefore plays a critical role in application performance. To reduce communication cost, interdependent tasks are allocated to nodes located close to one another. However, once the tasks have been allocated, nodes can move within a Grid. The movement of nodes within a Grid may result in multi-hop communication between nodes executing dependent tasks. In order to deal with node mobility within a Grid, an effective resource allocation scheme is required, but the design of such a scheme for mobile ad hoc computational Grids is challenging due to the constrained communication environment, node mobility, and infrastructure-less network environment. In this paper, we have developed an adaptive and distance-based resource allocation scheme which takes into account the characteristics of an application and nodes and applies migration heuristics to address the local node mobility problem. The scheme is validated in a simulated environment using various workloads and parameters.

Original languageEnglish
Pages (from-to)307-317
Number of pages11
JournalInformation Technology and Control
Volume41
Issue number4
Publication statusPublished - 2012 Dec 1

Fingerprint

Resource allocation
Communication
Costs
Data transfer

Keywords

  • Ad hoc networks
  • Computational grid
  • Interdependent tasks
  • Mobile grid
  • Resource allocation

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Control and Systems Engineering

Cite this

Shah, S. C., Park, M. S., Choi, W. S., Mir, Z. H., Chauhdary, S. H., Bashir, A. K., & Chandio, F. H. (2012). An adaptive and distance-based resource allocation scheme for interdependent tasks in mobile ad hoc computational grids. Information Technology and Control, 41(4), 307-317.

An adaptive and distance-based resource allocation scheme for interdependent tasks in mobile ad hoc computational grids. / Shah, Sayed Chhattan; Park, Myong Soon; Choi, Wan Sik; Mir, Zeeshan Hameed; Chauhdary, Sajjad Hussain; Bashir, Ali Kashif; Chandio, Fida Hussain.

In: Information Technology and Control, Vol. 41, No. 4, 01.12.2012, p. 307-317.

Research output: Contribution to journalArticle

Shah, SC, Park, MS, Choi, WS, Mir, ZH, Chauhdary, SH, Bashir, AK & Chandio, FH 2012, 'An adaptive and distance-based resource allocation scheme for interdependent tasks in mobile ad hoc computational grids', Information Technology and Control, vol. 41, no. 4, pp. 307-317.
Shah, Sayed Chhattan ; Park, Myong Soon ; Choi, Wan Sik ; Mir, Zeeshan Hameed ; Chauhdary, Sajjad Hussain ; Bashir, Ali Kashif ; Chandio, Fida Hussain. / An adaptive and distance-based resource allocation scheme for interdependent tasks in mobile ad hoc computational grids. In: Information Technology and Control. 2012 ; Vol. 41, No. 4. pp. 307-317.
@article{96d5f6aef08744b7b3687c4631033317,
title = "An adaptive and distance-based resource allocation scheme for interdependent tasks in mobile ad hoc computational grids",
abstract = "Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers between tasks residing on separate nodes. The communication is always expensive and unreliable in mobile ad hoc Grids and therefore plays a critical role in application performance. To reduce communication cost, interdependent tasks are allocated to nodes located close to one another. However, once the tasks have been allocated, nodes can move within a Grid. The movement of nodes within a Grid may result in multi-hop communication between nodes executing dependent tasks. In order to deal with node mobility within a Grid, an effective resource allocation scheme is required, but the design of such a scheme for mobile ad hoc computational Grids is challenging due to the constrained communication environment, node mobility, and infrastructure-less network environment. In this paper, we have developed an adaptive and distance-based resource allocation scheme which takes into account the characteristics of an application and nodes and applies migration heuristics to address the local node mobility problem. The scheme is validated in a simulated environment using various workloads and parameters.",
keywords = "Ad hoc networks, Computational grid, Interdependent tasks, Mobile grid, Resource allocation",
author = "Shah, {Sayed Chhattan} and Park, {Myong Soon} and Choi, {Wan Sik} and Mir, {Zeeshan Hameed} and Chauhdary, {Sajjad Hussain} and Bashir, {Ali Kashif} and Chandio, {Fida Hussain}",
year = "2012",
month = "12",
day = "1",
language = "English",
volume = "41",
pages = "307--317",
journal = "Information Technology and Control",
issn = "1392-124X",
publisher = "Kauno Technologijos Universitetas",
number = "4",

}

TY - JOUR

T1 - An adaptive and distance-based resource allocation scheme for interdependent tasks in mobile ad hoc computational grids

AU - Shah, Sayed Chhattan

AU - Park, Myong Soon

AU - Choi, Wan Sik

AU - Mir, Zeeshan Hameed

AU - Chauhdary, Sajjad Hussain

AU - Bashir, Ali Kashif

AU - Chandio, Fida Hussain

PY - 2012/12/1

Y1 - 2012/12/1

N2 - Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers between tasks residing on separate nodes. The communication is always expensive and unreliable in mobile ad hoc Grids and therefore plays a critical role in application performance. To reduce communication cost, interdependent tasks are allocated to nodes located close to one another. However, once the tasks have been allocated, nodes can move within a Grid. The movement of nodes within a Grid may result in multi-hop communication between nodes executing dependent tasks. In order to deal with node mobility within a Grid, an effective resource allocation scheme is required, but the design of such a scheme for mobile ad hoc computational Grids is challenging due to the constrained communication environment, node mobility, and infrastructure-less network environment. In this paper, we have developed an adaptive and distance-based resource allocation scheme which takes into account the characteristics of an application and nodes and applies migration heuristics to address the local node mobility problem. The scheme is validated in a simulated environment using various workloads and parameters.

AB - Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers between tasks residing on separate nodes. The communication is always expensive and unreliable in mobile ad hoc Grids and therefore plays a critical role in application performance. To reduce communication cost, interdependent tasks are allocated to nodes located close to one another. However, once the tasks have been allocated, nodes can move within a Grid. The movement of nodes within a Grid may result in multi-hop communication between nodes executing dependent tasks. In order to deal with node mobility within a Grid, an effective resource allocation scheme is required, but the design of such a scheme for mobile ad hoc computational Grids is challenging due to the constrained communication environment, node mobility, and infrastructure-less network environment. In this paper, we have developed an adaptive and distance-based resource allocation scheme which takes into account the characteristics of an application and nodes and applies migration heuristics to address the local node mobility problem. The scheme is validated in a simulated environment using various workloads and parameters.

KW - Ad hoc networks

KW - Computational grid

KW - Interdependent tasks

KW - Mobile grid

KW - Resource allocation

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

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

M3 - Article

AN - SCOPUS:84872249528

VL - 41

SP - 307

EP - 317

JO - Information Technology and Control

JF - Information Technology and Control

SN - 1392-124X

IS - 4

ER -