Scheduling dynamic parallel workload of mobile devices with access guarantees

Antonio Fernández Anta, Dariusz R. Kowalski, Miguel A. Mosteiro, Prudence W.H. Wong

Research output: Contribution to journalArticle

Abstract

We study a dynamic resource-allocation problem that arises in various parallel computing scenarios, such as mobile cloud computing, cloud computing systems, Internet of Things systems, and others. Generically, we model the architecture as client mobile devices and static base stations. Each client "arrives" to the system to upload data to base stations by radio transmissions and then "leaves." The problem, called Station Assignment, is to assign clients to stations so that every client uploads their data under some restrictions, including a target subset of stations, a maximum delay between transmissions, a volume of data to upload, and a maximum bandwidth for each station. We study the solvability of Station Assignment under an adversary that controls the arrival and departure of clients, limited to maximum rate and burstiness of such arrivals. We show upper and lower bounds on the rate and burstiness for various client arrival schedules and protocol classes. To the best of our knowledge, this is the first time that Station Assignment is studied under adversarial arrivals and departures.

Original languageEnglish (US)
Article number10
JournalACM Transactions on Parallel Computing
Volume5
Issue number2
DOIs
StatePublished - Jan 2018
Externally publishedYes

Fingerprint

Dynamic Scheduling
Mobile devices
Mobile Devices
Base stations
Workload
Assignment
Mobile cloud computing
Scheduling
Cloud Computing
Radio transmission
Parallel processing systems
Cloud computing
Resource allocation
Internet of Things
Mobile Computing
Parallel Computing
Bandwidth
Network protocols
Resource Allocation
Assign

Keywords

  • Continuous adversarial dynamics
  • Health monitoring systems
  • Internet of things
  • Mobile cloud computing
  • Radio networks
  • Station assignment

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Hardware and Architecture
  • Software
  • Modeling and Simulation

Cite this

Scheduling dynamic parallel workload of mobile devices with access guarantees. / Anta, Antonio Fernández; Kowalski, Dariusz R.; Mosteiro, Miguel A.; Wong, Prudence W.H.

In: ACM Transactions on Parallel Computing, Vol. 5, No. 2, 10, 01.2018.

Research output: Contribution to journalArticle

Anta, Antonio Fernández ; Kowalski, Dariusz R. ; Mosteiro, Miguel A. ; Wong, Prudence W.H. / Scheduling dynamic parallel workload of mobile devices with access guarantees. In: ACM Transactions on Parallel Computing. 2018 ; Vol. 5, No. 2.
@article{6a119fcfc7b745aba57c47d795874a8b,
title = "Scheduling dynamic parallel workload of mobile devices with access guarantees",
abstract = "We study a dynamic resource-allocation problem that arises in various parallel computing scenarios, such as mobile cloud computing, cloud computing systems, Internet of Things systems, and others. Generically, we model the architecture as client mobile devices and static base stations. Each client {"}arrives{"} to the system to upload data to base stations by radio transmissions and then {"}leaves.{"} The problem, called Station Assignment, is to assign clients to stations so that every client uploads their data under some restrictions, including a target subset of stations, a maximum delay between transmissions, a volume of data to upload, and a maximum bandwidth for each station. We study the solvability of Station Assignment under an adversary that controls the arrival and departure of clients, limited to maximum rate and burstiness of such arrivals. We show upper and lower bounds on the rate and burstiness for various client arrival schedules and protocol classes. To the best of our knowledge, this is the first time that Station Assignment is studied under adversarial arrivals and departures.",
keywords = "Continuous adversarial dynamics, Health monitoring systems, Internet of things, Mobile cloud computing, Radio networks, Station assignment",
author = "Anta, {Antonio Fern{\'a}ndez} and Kowalski, {Dariusz R.} and Mosteiro, {Miguel A.} and Wong, {Prudence W.H.}",
year = "2018",
month = "1",
doi = "10.1145/3291529",
language = "English (US)",
volume = "5",
journal = "ACM Transactions on Parallel Computing",
issn = "2329-4949",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - Scheduling dynamic parallel workload of mobile devices with access guarantees

AU - Anta, Antonio Fernández

AU - Kowalski, Dariusz R.

AU - Mosteiro, Miguel A.

AU - Wong, Prudence W.H.

PY - 2018/1

Y1 - 2018/1

N2 - We study a dynamic resource-allocation problem that arises in various parallel computing scenarios, such as mobile cloud computing, cloud computing systems, Internet of Things systems, and others. Generically, we model the architecture as client mobile devices and static base stations. Each client "arrives" to the system to upload data to base stations by radio transmissions and then "leaves." The problem, called Station Assignment, is to assign clients to stations so that every client uploads their data under some restrictions, including a target subset of stations, a maximum delay between transmissions, a volume of data to upload, and a maximum bandwidth for each station. We study the solvability of Station Assignment under an adversary that controls the arrival and departure of clients, limited to maximum rate and burstiness of such arrivals. We show upper and lower bounds on the rate and burstiness for various client arrival schedules and protocol classes. To the best of our knowledge, this is the first time that Station Assignment is studied under adversarial arrivals and departures.

AB - We study a dynamic resource-allocation problem that arises in various parallel computing scenarios, such as mobile cloud computing, cloud computing systems, Internet of Things systems, and others. Generically, we model the architecture as client mobile devices and static base stations. Each client "arrives" to the system to upload data to base stations by radio transmissions and then "leaves." The problem, called Station Assignment, is to assign clients to stations so that every client uploads their data under some restrictions, including a target subset of stations, a maximum delay between transmissions, a volume of data to upload, and a maximum bandwidth for each station. We study the solvability of Station Assignment under an adversary that controls the arrival and departure of clients, limited to maximum rate and burstiness of such arrivals. We show upper and lower bounds on the rate and burstiness for various client arrival schedules and protocol classes. To the best of our knowledge, this is the first time that Station Assignment is studied under adversarial arrivals and departures.

KW - Continuous adversarial dynamics

KW - Health monitoring systems

KW - Internet of things

KW - Mobile cloud computing

KW - Radio networks

KW - Station assignment

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

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

U2 - 10.1145/3291529

DO - 10.1145/3291529

M3 - Article

AN - SCOPUS:85061201347

VL - 5

JO - ACM Transactions on Parallel Computing

JF - ACM Transactions on Parallel Computing

SN - 2329-4949

IS - 2

M1 - 10

ER -