Scheduling Problems in a Practical Allocation Model

Lisa Hollermann (), Tsan-sheng Hsu (), Dian Rae Lopez () and Keith Vertanen ()
Additional contact information
Lisa Hollermann: IBM Corporation
Tsan-sheng Hsu: Institute of Information Science, Academia Sinica, Nankang
Dian Rae Lopez: University of Minnesota
Keith Vertanen: Linkvping Universitet

Journal of Combinatorial Optimization, 1997, vol. 1, issue 2, No 2, 129-149

Abstract: Abstract A parallel computational model is defined which addresses I/O contention,latency, and pipe-lined message passing between tasks allocated to differentprocessors. The model can be used for parallel task-allocation on either anetwork of workstations or on a multi-stage inter-connected parallel machine.To study performance bounds more closely, basic properties are developed forwhen the precedence constraints form a directed tree. It is shown that theproblem of optimally scheduling a directed one-level precedence tree on anunlimited number of identical processors in this model is NP-hard. Theproblem of scheduling a directed two-level precedence tree is also shown tobe NP-hard even when the system latency is zero. An approximation algorithm is then presented for scheduling directedone-level task trees on an unlimited number of processors with anapproximation ratio of 3. Simulation results show that this algorithm is, infact, much faster than its worst-case performance bound. Better simulationresults are obtained by improving our approximation algorithm usingheusistics. Restricting the problem to the case of equal task executiontimes, a linear-time algorithm is presented to find an optimal schedule.

Keywords: Schedule Problem; Computational Model; Approximation Algorithm; Study Performance; Discrete Geometry (search for similar items in EconPapers)
Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1009799631608 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:1:y:1997:i:2:d:10.1023_a:1009799631608

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

DOI: 10.1023/A:1009799631608

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 ().