A general bound on schedule length for independent tasks

Sathiamoorthy Manoharan, Nigel P. Topham

Research output: Contribution to journal › Article › peer-review

Abstract

In this note we generalize and improve the bound on schedule length presented by Graham [3,4] for a set of independent tasks.

Original language	English
Pages (from-to)	69-73
Number of pages	5
Journal	Parallel Computing: Systems & Applications
Volume	16
Issue number	1
DOIs	https://doi.org/10.1016/0167-8191(90)90160-B
Publication status	Published - 1990

@article{a2a82294e22a494a9be9d97ce93b529c,

title = "A general bound on schedule length for independent tasks",

abstract = "In this note we generalize and improve the bound on schedule length presented by Graham [3,4] for a set of independent tasks.",

author = "Sathiamoorthy Manoharan and Topham, \{Nigel P.\}",

year = "1990",

doi = "10.1016/0167-8191(90)90160-B",

language = "English",

volume = "16",

pages = "69--73",

journal = "Parallel Computing: Systems \& Applications",

issn = "0167-8191",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - A general bound on schedule length for independent tasks

AU - Manoharan, Sathiamoorthy

AU - Topham, Nigel P.

PY - 1990

Y1 - 1990

N2 - In this note we generalize and improve the bound on schedule length presented by Graham [3,4] for a set of independent tasks.

AB - In this note we generalize and improve the bound on schedule length presented by Graham [3,4] for a set of independent tasks.

U2 - 10.1016/0167-8191(90)90160-B

DO - 10.1016/0167-8191(90)90160-B

M3 - Article

SN - 0167-8191

VL - 16

SP - 69

EP - 73

JO - Parallel Computing: Systems & Applications

JF - Parallel Computing: Systems & Applications

IS - 1

ER -