Author:
Zheng Feifeng,Xu Yinfeng,Poon Chung Keung,Zhang E.,Wu Xiaoping
Subject
General Engineering,General Computer Science
Reference19 articles.
1. On the competitiveness of on-line real-time task scheduling;Baruah;Real-Time Systems,1992
2. Baruah, S., Koren, G., Mishra, B., Raghunathan, A., Rosier, L., & Shasha, D. (1991). On-line scheduling in the presence of overload. In 32nd Annual symposium on foundations of computer science (pp. 100–110).
3. Online computation and competitive analysis;Borodin,1998
4. Lower bounds on online deadline scheduling with preemption penalties;Fung;Information Processing Letters,2008
5. Fung, S., Chin, F., & Poon, C. (2005). Laxity helps in broadcast scheduling. In Proceedings of 9th Italian conference on theoretical computer science, Lecture notes in computer science (Vol. 3701, pp. 251–264). Springer.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献