An approximation scheme for scheduling of malleable parallel tasks - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Klaus Jansen. An approximation scheme for scheduling of malleable parallel tasks. In Panos M. Pardalos, Sanguthevar Rajasekaran, José Rolim, editors, Randomization Methods in Algorithm Design, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, December 12-14, 1997. Volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 109-122, DIMACS/AMS, 1997.

The following publications are possibly variants of this publication:

Linear-Time Approximation Schemes for Scheduling Malleable Parallel TasksKlaus Jansen, Lorant Porkolab. soda 1999: 490-498 [doi]

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation SchemeKlaus Jansen. esa 2002: 562-573 [doi]

Linear-Time Approximation Schemes for Scheduling Malleable Parallel TasksKlaus Jansen, Lorant Porkolab. algorithmica, 32(3):507-520, 2002. [doi]

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation SchemeKlaus Jansen. algorithmica, 39(1):59-81, 2004. [doi]

runs on WebDSL