Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks

Keqin Li ()
Additional contact information
Keqin Li: State University of New York

Journal of Combinatorial Optimization, 1999, vol. 3, issue 1, No 6, 73-88

Abstract: Abstract Given P processors, and a set of precedence constrained parallel tasks with their processor requirements and execution times, the problem of scheduling precedence constrained parallel tasks on multiprocessors is to find a nonpreemptive schedule of the tasks on a multiprocessor with P processors, such that the schedule length is minimized. We show that for many heuristic choices of the initial priority list, the list scheduling algorithm has worst-case performance ratio P, which is unbounded as P gets large. However, it is also shown that when task sizes are bounded from above by a fraction of P, the list scheduling algorithm has finite worst-case performance ratio. In particular, we prove that if all tasks request for no more than qP processors, where 0

Keywords: list scheduling; parallel task; precedence constraint; task scheduling; worst-case performance ratio (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009817206440 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:3:y:1999:i:1:d:10.1023_a:1009817206440

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009817206440

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().