Funder
I-CORE
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference25 articles.
1. Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differential services. In: Proceedings of IEEE INFOCOM, pp. 431–440 (2000)
2. Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM J. Comput. 35(2), 278–304 (2005)
3. Azar, Y., Litichevskey, A.: Maximizing throughput in multi-queue switches. In: Algorithms—ESA, pp. 53–64. Springer (2004)
4. Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. ACM Trans. Algorithms 2(2), 282–295 (2006)
5. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 606–615. ACM (1995)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Price of Bounded Preemption;ACM Transactions on Parallel Computing;2021-04
2. The Price of Bounded Preemption;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11