ABSTRACT
No abstract available.
- P. Brucker. Scheduling Algorithms. Springer, 3rd edition, 2001. Google ScholarDigital Library
- H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.Google ScholarCross Ref
- Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406--471, Dec. 1999. Google ScholarDigital Library
Index Terms
- Deadline scheduling for animation rendering
Recommendations
Value-maximizing deadline scheduling and its application to animation rendering
SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architecturesWe describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multiprocessor deadline scheduling problem that arises in several commercially-...
Online deadline scheduling with preemption penalties
This paper presents a study of the problem of online deadline scheduling under the preemption penalty model of Zheng, Xu, and Zhang (2007). In that model, each preemption incurs a penalty of @r times the weight of the preempted job, where @r>=0 is the ...
Comments