Fault tolerant scheduling of tasks of two sizes under resource augmentation

Dariusz R. Kowalski, Prudence W.H. Wong, Elli Zavou

Research output: Contribution to journalArticle

1 Scopus citations

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 γ-Burst, that achieves both latency and 1-completed-load competitiveness when the speedup is over the threshold. This also proves that the threshold identified is also sufficient for competitiveness.

Original languageEnglish (US)
Pages (from-to)695-711
Number of pages17
JournalJournal of Scheduling
Volume20
Issue number6
DOIs
Publication statusPublished - Dec 1 2017
Externally publishedYes

    Fingerprint

Keywords

  • Adversarial failures
  • Competitive analysis
  • Online algorithms
  • Resource augmentation
  • Scheduling
  • Task sizes

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Management Science and Operations Research
  • Artificial Intelligence

Cite this