Executed-time Round Robin
Abstract
References
Index Terms
- Executed-time Round Robin
Recommendations
Non-clairvoyant weighted flow time scheduling with rejection penalty
SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architecturesThis paper initiates the study of online scheduling with rejection penalty in the non-clairvoyant setting, i.e., the size (processing time) of a job is not assumed to be known at its release time. In the rejection penalty model, jobs can be rejected ...
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
We study non-clairvoyant scheduling to minimize weighted flow time on two different multi-processor models. In the first model, processors are all identical and jobs can possibly be speeded up by running on several processors in parallel. Under the non-...
Competitive online algorithms for multiple-machine power management and weighted flow time
CATS '13: Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141We consider online job scheduling together with power management on multiple machines. In this model, jobs with arbitrary sizes and weights arrive online, and each machine consumes different amount of energy when it is processing a job, idling or ...
Comments
Information & Contributors
Information
Published In
Publisher
Elsevier Science Inc.
United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in