Skip to main content
Article thumbnail
Location of Repository

Online interval scheduling: randomized and multiprocessor cases

By S.P.Y. Fung, C.K. Poon and F. Zheng

Abstract

This is the authors final draft of the version published as Lecture Notes in Computer Science, 2007, 4598, pp.176-186. The final published version can be accessed via http://www.springerlink.com/content/r6841w772p72m776/?p=635c4809c6b54409979e6b005741bf61&pi=

Publisher: SpringerLink
Year: 2007
OAI identifier: oai:lra.le.ac.uk:2381/3830

Suggested articles

Citations

  1. A near optimal scheduler for on-demand data broadcasts. doi
  2. (1999). A short proof that proper = unit. doi
  3. (2004). An improved randomized on-line algorithm for a weighted interval selection problem. doi
  4. (1998). Bounding the power of preemption in randomized scheduling. doi
  5. (1994). Competitive non-preemptive call control.
  6. (1995). Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. doi
  7. (1991). Greedy k-coverings of interval orders.
  8. (2006). Improved on-line broadcast scheduling with deadlines. doi
  9. (2005). Laxity helps in broadcast scheduling. doi
  10. MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. doi
  11. (2004). New results on ondemand broadcasting with deadline via job scheduling with cancellation. doi
  12. (1992). On the competitiveness of on-line real-time task scheduling. RealTime Systems, doi
  13. (1994). On-line scheduling of jobs with fixed start and end times. doi
  14. (1994). Online interval scheduling.
  15. (1998). Randomized online interval scheduling. doi
  16. (2004). Scheduling broadcasts with deadlines. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.