Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme
- 23 January 2004
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 39 (1) , 59-81
- https://doi.org/10.1007/s00453-003-1078-6
Abstract
No abstract availableKeywords
This publication has 0 references indexed in Scilit: