Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

• 1 March 2002
• journal article
• Published by Springer Nature in Algorithmica
• Vol. 32  (3) , 507-520
• https://doi.org/10.1007/s00453-001-0085-8

Abstract

Keywords

• FUNCTION
• PARALLEL
• SCHEDULE
• PREEMPTIVE
• APPROXIMATION SCHEMES
• MALLEABLE
• ALLOTED
• NINDEPENDENT