Showing results 1 to 12 of 12
Title | Author(s) | Issue Date | |
---|---|---|---|
Aggressive online deadline scheduling Journal:Electronic Notes in Theoretical Computer Science | 2004 | ||
Competitive deadline scheduling via additional or faster processors Journal:Journal of Scheduling | 2003 | ||
Competitive deadline scheduling via extra resources Book:Computational Mathematics, Modelling and Algorithms | 2003 | ||
Dynamic dictionary matching revisited Proceeding/Conference:Proceedings of ICS'96 International Conference on Algorithms, Taiwan, December 1996 | 1996 | ||
Extra processors versus future information in optimal deadline scheduling Proceeding/Conference:Annual ACM Symposium on Parallel Algorithms and Architectures | 2002 | ||
Extra processors versus future information in optimal deadline scheduling Journal:Theory of Computing Systems | 2004 | ||
Non-migratory Online Deadline Scheduling on Multiprocessors Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2004 | ||
On-line load balancing of temporary tasks revisited Journal:Theoretical Computer Science | 2002 | ||
On-line scheduling with tight deadlines Journal:Theoretical Computer Science | 2003 | ||
Performance guarantee for EDF under overload Journal:Journal of Algorithms | 2004 | ||
Performance guarantee for online deadline scheduling in the presence of overload Proceeding/Conference:Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms | 2001 | ||
A tighter extra-resource analysis of online deadline scheduling Journal:Journal of Combinatorial Optimization | 2005 |