Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
暂无分享,去创建一个
[1] Nguyen Kim Thang,et al. Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling , 2013, ESA.
[2] Kirk Pruhs,et al. Online Scheduling with General Cost Functions , 2012, SIAM J. Comput..
[3] Nikhil Bansal,et al. Weighted flow time does not admit O(1)-competitive algorithms , 2009, SODA.
[4] Amit Kumar,et al. Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.
[5] Kyle Fox,et al. Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions , 2013, APPROX-RANDOM.
[6] Kirk Pruhs,et al. A tutorial on amortized local competitiveness in online scheduling , 2011, SIGA.
[7] Julián Mestre,et al. How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions , 2014, ICALP.
[8] Evangelos Markakis,et al. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.
[9] Kirk Pruhs,et al. Nonclairvoyantly scheduling power-heterogeneous processors , 2010, International Conference on Green Computing.
[10] Kirk Pruhs,et al. SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[11] Kirk Pruhs,et al. Server Scheduling in the Weighted lp Norm , 2004, LATIN.
[12] Kirk Pruhs,et al. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules , 2017, Algorithmica.
[13] Jeff Edmonds,et al. Scheduling in the dark , 1999, STOC '99.
[14] Rajeev Motwani,et al. Non-clairvoyant scheduling , 1994, SODA '93.
[15] Kirk Pruhs,et al. Online weighted flow time and deadline scheduling , 2006, J. Discrete Algorithms.
[16] Kirk Pruhs,et al. Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling , 2011, WAOA.
[17] Kirk Pruhs,et al. Scheduling heterogeneous processors isn't as easy as you think , 2012, SODA.
[18] Nikhil R. Devanur,et al. Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms , 2014, SODA.
[19] Kirk Pruhs,et al. Scalably scheduling processes with arbitrary speedup curves , 2009, TALG.
[20] Kamesh Munagala,et al. Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints , 2014, STOC.
[21] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[22] Kirk Pruhs,et al. The Geometry of Scheduling , 2010, FOCS.