Autonomous mobility skeletons

Xiao Yan Deng, Greg Michaelson, Phil Trinder

Research output: Contribution to journalArticle

Abstract

To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of directly programming AMPs is that the cost model, mobility decision function, and network interrogation are all explicit in the program. This paper proposes autonomous mobility skeletons that encapsulate self-aware mobile coordination for common patterns of computation over collections. Autonomous mobility skeletons are akin to algorithmic skeletons in being polymorphic higher order functions, but where algorithmic skeletons abstract over parallel coordination, autonomous mobility skeletons abstract over autonomous mobile coordination. We present the automap, autofold and autoiter autonomous mobility skeletons, together with performance measurements of Jocaml, Java Voyager, and JavaGo implementations on small networks. autoiter is an unusual skeleton, abstracting over the Iterator interface commonly used with Java collections. © 2006 Elsevier B.V. All rights reserved.

Original languageEnglish
Pages (from-to)463-478
Number of pages16
JournalParallel Computing
Volume32
Issue number7-8
DOIs
Publication statusPublished - Sep 2006

Fingerprint

Costs

Keywords

  • Autonomous mobile programs
  • Java voyager
  • JavaGo
  • Jocaml
  • Mobile computation
  • Skeletons

Cite this

Deng, Xiao Yan ; Michaelson, Greg ; Trinder, Phil. / Autonomous mobility skeletons. In: Parallel Computing. 2006 ; Vol. 32, No. 7-8. pp. 463-478.
@article{71e38810e7644a3390befd2a7f781e93,
title = "Autonomous mobility skeletons",
abstract = "To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of directly programming AMPs is that the cost model, mobility decision function, and network interrogation are all explicit in the program. This paper proposes autonomous mobility skeletons that encapsulate self-aware mobile coordination for common patterns of computation over collections. Autonomous mobility skeletons are akin to algorithmic skeletons in being polymorphic higher order functions, but where algorithmic skeletons abstract over parallel coordination, autonomous mobility skeletons abstract over autonomous mobile coordination. We present the automap, autofold and autoiter autonomous mobility skeletons, together with performance measurements of Jocaml, Java Voyager, and JavaGo implementations on small networks. autoiter is an unusual skeleton, abstracting over the Iterator interface commonly used with Java collections. {\circledC} 2006 Elsevier B.V. All rights reserved.",
keywords = "Autonomous mobile programs, Java voyager, JavaGo, Jocaml, Mobile computation, Skeletons",
author = "Deng, {Xiao Yan} and Greg Michaelson and Phil Trinder",
year = "2006",
month = "9",
doi = "10.1016/j.parco.2006.04.002",
language = "English",
volume = "32",
pages = "463--478",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "7-8",

}

Autonomous mobility skeletons. / Deng, Xiao Yan; Michaelson, Greg; Trinder, Phil.

In: Parallel Computing, Vol. 32, No. 7-8, 09.2006, p. 463-478.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Autonomous mobility skeletons

AU - Deng, Xiao Yan

AU - Michaelson, Greg

AU - Trinder, Phil

PY - 2006/9

Y1 - 2006/9

N2 - To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of directly programming AMPs is that the cost model, mobility decision function, and network interrogation are all explicit in the program. This paper proposes autonomous mobility skeletons that encapsulate self-aware mobile coordination for common patterns of computation over collections. Autonomous mobility skeletons are akin to algorithmic skeletons in being polymorphic higher order functions, but where algorithmic skeletons abstract over parallel coordination, autonomous mobility skeletons abstract over autonomous mobile coordination. We present the automap, autofold and autoiter autonomous mobility skeletons, together with performance measurements of Jocaml, Java Voyager, and JavaGo implementations on small networks. autoiter is an unusual skeleton, abstracting over the Iterator interface commonly used with Java collections. © 2006 Elsevier B.V. All rights reserved.

AB - To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of directly programming AMPs is that the cost model, mobility decision function, and network interrogation are all explicit in the program. This paper proposes autonomous mobility skeletons that encapsulate self-aware mobile coordination for common patterns of computation over collections. Autonomous mobility skeletons are akin to algorithmic skeletons in being polymorphic higher order functions, but where algorithmic skeletons abstract over parallel coordination, autonomous mobility skeletons abstract over autonomous mobile coordination. We present the automap, autofold and autoiter autonomous mobility skeletons, together with performance measurements of Jocaml, Java Voyager, and JavaGo implementations on small networks. autoiter is an unusual skeleton, abstracting over the Iterator interface commonly used with Java collections. © 2006 Elsevier B.V. All rights reserved.

KW - Autonomous mobile programs

KW - Java voyager

KW - JavaGo

KW - Jocaml

KW - Mobile computation

KW - Skeletons

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

U2 - 10.1016/j.parco.2006.04.002

DO - 10.1016/j.parco.2006.04.002

M3 - Article

VL - 32

SP - 463

EP - 478

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 7-8

ER -