Fault Tolerant Scheduling of Tasks of Two Sizes under Resource Augmentation



Kowalski, , Wong, PW ORCID: 0000-0001-7935-7245 and Zavou, E
(2017) Fault Tolerant Scheduling of Tasks of Two Sizes under Resource Augmentation. Journal of Scheduling, 20 (6). 695 - 711.

[img] Text
main.pdf - Accepted Version

Download (325kB)

Abstract

Guaranteeing the eventual execution of tasks in machines that are prone to unpredictable crashes and restarts may be challenging, but is also of high importance. Things become even more complicated when tasks arrive dynamically and have different computational demands, i.e., processing time (or sizes). In this paper, we focus on the online task scheduling in such systems, considering one machine and at least two different task sizes. More specifically, algorithms are designed for two different task sizes while the complementary bounds hold for any number of task sizes bigger than one. We look at the latency and 1-completed load competitiveness properties of deterministic scheduling algorithms under worst-case scenarios. For this, we assume an adversary, that controls the machine crashes and restarts as well as the task arrivals of the system, including their computational demands. More precisely, we investigate the effect of resource augmentation—in the form of processor speedup—in the machine’s performance, by looking at the two efficiency measures for different speedups. We first identify the threshold of the speedup under which competitiveness cannot be achieved by any deterministic algorithm, and above which there exists some deterministic algorithm that is competitive. We then propose an online algorithm, named

Item Type: Article
Uncontrolled Keywords: scheduling, online algorithms, task sizes, adversarial failures, resource augmentation, competitive analysis
Depositing User: Symplectic Admin
Date Deposited: 01 Aug 2017 09:12
Last Modified: 27 Nov 2020 13:11
DOI: 10.1007/s10951-017-0541-1
Related URLs:
URI: http://livrepository.liverpool.ac.uk/id/eprint/3008702