Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Speed is More Powerful than Claivoyance
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Minimizing flow time nonclairvoyantly
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Applying extra-resource analysis to load balancing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Performance guarantee for online deadline scheduling in the presence of overload
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Extra processors versus future information in optimal deadline scheduling
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the speed requirement for optimal deadline scheduling in overloaded systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On-Line Scheduling with Tight Deadlines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Resource Augmentation in Load Balancing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Preemptive Scheduling in Overloaded Systems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On-line scheduling with tight deadlines
Theoretical Computer Science - Mathematical foundations of computer science
Preemptive scheduling in overloaded systems
Journal of Computer and System Sciences
Non-migratory online deadline scheduling on multiprocessors
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive deadline scheduling via additional or faster processors
Journal of Scheduling - Special issue: On-line algorithm part I
Performance guarantee for EDF under overload
Journal of Algorithms
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Meeting deadlines: how much speed suffices?
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Optimal online algorithms on two hierarchical machines with resource augmentation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |