On the complexity of list scheduling algorithms for distributed-memory systems
Conference Paper
(1999)
Author(s)
A Radulescu (TU Delft - Data-Intensive Systems)
Arjan van Gemund (TU Delft - Data-Intensive Systems)
Research Group
Data-Intensive Systems
To reference this document use:
https://resolver.tudelft.nl/uuid:97c70bae-a20f-4f9c-beca-65ef05271f09
More Info
expand_more
expand_more
Publication Year
1999
Research Group
Data-Intensive Systems
Pages (from-to)
68-75
ISBN (print)
1-58113-164-X
No files available
Metadata only record. There are no files for this record.