Precedence-Constrained Scheduling of Malleable Jobs with Preemption
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 823-834
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Energy Efficient Scheduling of Parallelizable Jobs2013
- Scalably scheduling processes with arbitrary speedup curvesACM Transactions on Algorithms, 2012
- Speed Scaling of Processes with Arbitrary Speedup Curves on a MultiprocessorTheory of Computing Systems, 2011
- Optimal Long Code Test with One Free Bit2009
- Precedence constrained scheduling in optimalJournal of Computer and System Sciences, 2008
- Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution CharacteristicsJournal of Scheduling, 2003
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related MachinesJournal of Algorithms, 2001
- Scheduling in the darkTheoretical Computer Science, 2000
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different SpeedsJournal of Algorithms, 1999
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule LengthSIAM Journal on Discrete Mathematics, 1989