Author:
Wolf Joel,Nabi Zubair,Nagarajan Viswanath,Saccone Robert,Wagle Rohit,Hildrum Kirsten,Pring Edward,Sarpatwar Kanthi
Reference29 articles.
1. Y. Azar, I. Cohen, S. Kamara and B. Shepherd. Tight Bounds for Online V Bin Packing. InProceedings of STOC, 2013.
2. J. Boyar, K. Larsen and M. Nielsen. The Accommodating Function - A Generalization of the Competitive Ratio. InProceedings of IADS, 1999.
3. C. Chekura and S. Khanna A PTAS for the Multiple Knapsack Problem. InProceedings of SODA, 2000.
4. R. Cohen, L. Katzir and D. Raz. An Efficient Approximation for the Generalized Assignment Problem.Information Processing Letters, 100(4): 162--166, 2006.
5. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters.ACM Transactions on Computer Systems, 51(1):107--113, 2008.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Jargon of Hadoop MapReduce scheduling techniques: a scientific categorization;The Knowledge Engineering Review;2019-03-15
2. The X-flex cross-platform scheduler;Proceedings of the Middleware Industry Track on - Industry papers;2014