On Multiprocessor System Scheduling

Xiaotie Deng and Patrick Dymond
Additional contact information
Xiaotie Deng: York University
Patrick Dymond: York University

Journal of Combinatorial Optimization, 1998, vol. 1, issue 4, No 4, 377-392

Abstract: Abstract We show that there is a good algorithm for scheduling the average completion time of a set of unknown DAGs (i.e., data dependency relation graphs of programs) on a multiprocessor in the PRAM model (Karp and Ramachandran, 1990) (orother similar shared memory models.) Then, we show that a large class ofparallel jobs can be scheduled with near-optimal average completion time in the BSP model (Valiant, 1990a) though this is not possible for theclass of all unknown DAGs (Deng and Koutsoupias, 1993) (the same holds forother similar distributed memory models.)

Keywords: Mathematical Modeling; Industrial Mathematic; Completion Time; Large Class; Shared Memory (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009790611712 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:1998:i:4:d:10.1023_a:1009790611712

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

DOI: 10.1023/A:1009790611712

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