Algorithms for Scheduling Tasks on Unrelated Processors

Ernest Davis, Jeffrey M. Jaffe

Research output: Contribution to journalArticle

Abstract

Several algorithms are presented for the nonpreemptlve assignment of n independent tasks to m unrelated processors One algorithm requires polynomial Ume in n and m and IS at most 2√m times worse than optimal in the worst case This is the best polynomial-time algorithm known for scheduling such sets of tasks. An algorithm with slightly better worst case performance requires polynomial time in n but exponential tume in m This 1s the best algorithm known that requires time [formula omitted] for every fixed value of m.

Original languageEnglish (US)
Pages (from-to)721-736
Number of pages16
JournalJournal of the ACM
Volume28
Issue number4
DOIs
StatePublished - Oct 1 1981

Fingerprint

Scheduling
Polynomials
Set theory

Keywords

  • largest processing time
  • nonpreemptlve schedules
  • performance ratio
  • unrelated processors
  • worst case fimshlng time

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Cite this

Algorithms for Scheduling Tasks on Unrelated Processors. / Davis, Ernest; Jaffe, Jeffrey M.

In: Journal of the ACM, Vol. 28, No. 4, 01.10.1981, p. 721-736.

Research output: Contribution to journalArticle

Davis, Ernest ; Jaffe, Jeffrey M. / Algorithms for Scheduling Tasks on Unrelated Processors. In: Journal of the ACM. 1981 ; Vol. 28, No. 4. pp. 721-736.
@article{44704f36dc9d4581838ef704331f0bfd,
title = "Algorithms for Scheduling Tasks on Unrelated Processors",
abstract = "Several algorithms are presented for the nonpreemptlve assignment of n independent tasks to m unrelated processors One algorithm requires polynomial Ume in n and m and IS at most 2√m times worse than optimal in the worst case This is the best polynomial-time algorithm known for scheduling such sets of tasks. An algorithm with slightly better worst case performance requires polynomial time in n but exponential tume in m This 1s the best algorithm known that requires time [formula omitted] for every fixed value of m.",
keywords = "largest processing time, nonpreemptlve schedules, performance ratio, unrelated processors, worst case fimshlng time",
author = "Ernest Davis and Jaffe, {Jeffrey M.}",
year = "1981",
month = "10",
day = "1",
doi = "10.1145/322276.322284",
language = "English (US)",
volume = "28",
pages = "721--736",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Algorithms for Scheduling Tasks on Unrelated Processors

AU - Davis, Ernest

AU - Jaffe, Jeffrey M.

PY - 1981/10/1

Y1 - 1981/10/1

N2 - Several algorithms are presented for the nonpreemptlve assignment of n independent tasks to m unrelated processors One algorithm requires polynomial Ume in n and m and IS at most 2√m times worse than optimal in the worst case This is the best polynomial-time algorithm known for scheduling such sets of tasks. An algorithm with slightly better worst case performance requires polynomial time in n but exponential tume in m This 1s the best algorithm known that requires time [formula omitted] for every fixed value of m.

AB - Several algorithms are presented for the nonpreemptlve assignment of n independent tasks to m unrelated processors One algorithm requires polynomial Ume in n and m and IS at most 2√m times worse than optimal in the worst case This is the best polynomial-time algorithm known for scheduling such sets of tasks. An algorithm with slightly better worst case performance requires polynomial time in n but exponential tume in m This 1s the best algorithm known that requires time [formula omitted] for every fixed value of m.

KW - largest processing time

KW - nonpreemptlve schedules

KW - performance ratio

KW - unrelated processors

KW - worst case fimshlng time

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

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

U2 - 10.1145/322276.322284

DO - 10.1145/322276.322284

M3 - Article

AN - SCOPUS:0019625166

VL - 28

SP - 721

EP - 736

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 4

ER -