Preemptive scheduling in overloaded systems

Marek Chrobak, Leah Epstein, John Noga, Jiří Sgall, Rob Van Stee, Tomáš Tichý, Nodari Vakhania

Research output: Contribution to journalArticlepeer-review

Abstract

The following scheduling problem is studied: We are given a set of tasks with release times, deadlines, and profit rates. The objective is to determine a 1-processor preemptive schedule of the given tasks that maximizes the overall profit. In the standard model, each completed task brings profit, while noncompleted tasks do not. In the metered model, a task brings profit proportional to the execution time even if not completed. For the metered task model, we present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms. Furthermore, we prove three lower bound results concerning resource augmentation in both models.

Original languageEnglish
Pages (from-to)183-197
Number of pages15
JournalJournal of Computer and System Sciences
Volume67
Issue number1
DOIs
StatePublished - Aug 2003
Externally publishedYes

Keywords

  • Deadline
  • Online algorithms
  • Resource augmentation
  • Scheduling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Preemptive scheduling in overloaded systems'. Together they form a unique fingerprint.

Cite this