Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

Klaus Jansen

Journal Title: Algorithmica

Date: 2004

Volume: 39

Issue: 1

p. 59 - 81

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.sna.csie.ndhu.edu.tw/~lung/course/92b/ESA200x/2002/ESA2002562.pdf

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-003-1078-6

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12