On the complexity of list scheduling algorithms for distributed-memory systems

Conference paper (1999)

Authors

A Radulescu Data-Intensive Systems - EEMCS
A.J.C. van Gemund Data-Intensive Systems - EEMCS
Research Group
Data-Intensive Systems (EEMCS) (TU Delft)
More Info
expand_more

Published Date

1999

Language

Undefined/Unknown

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Data-Intensive Systems