Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees

Fernandez Anta, Antonio, Kowalski, Dariusz R ORCID: 0000-0002-1316-7788, Mosteiro, Miguel A and Wong, Prudence WH ORCID: 0000-0001-7935-7245 (2018) Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees. ACM TRANSACTIONS ON PARALLEL COMPUTING, 5 (2). pp. 1-19.

Text draft.pdf - Author Accepted Manuscript Download (391kB)

Abstract

<jats:p> 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 <jats:italic>Station Assignment</jats:italic> , 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. </jats:p>

Item Type:	Article
Uncontrolled Keywords:	Station assignment, mobile cloud computing, radio networks, continuous adversarial dynamics, internet of things, health monitoring systems
Depositing User:	Symplectic Admin
Date Deposited:	25 Jul 2018 06:51
Last Modified:	19 Jan 2023 01:30
DOI:	10.1145/3291529
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3024119