Non-clairvoyant Precedence Constrained Scheduling
暂无分享,去创建一个
Amit Kumar | Anupam Gupta | Naveen Garg | Sahil Singla | Anupam Gupta | Naveen Garg | Amit Kumar | Sahil Singla
[1] Amit Kumar,et al. Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.
[2] Julien Robert,et al. Non-clairvoyant scheduling with precedence constraints , 2008, SODA '08.
[3] Kamesh Munagala,et al. Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints , 2014, STOC.
[4] 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.
[5] Kirk Pruhs,et al. Scalably scheduling processes with arbitrary speedup curves , 2009, TALG.
[6] David B. Shmoys,et al. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..
[7] Xiaotie Deng,et al. Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics (extended abstract) , 1997, STOC '97.
[8] Abbas Bazzi,et al. Towards Tight Lower Bounds for Scheduling Problems , 2015, ESA.
[9] Benjamin Moseley,et al. Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time , 2016, SODA.
[10] Fabián A. Chudak,et al. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.
[11] Maurice Queyranne,et al. Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, IPCO.
[12] Jeff Edmonds. Scheduling in the dark , 2000, Theor. Comput. Sci..
[13] Srikanth Kandula,et al. This Paper Is Included in the Proceedings of the 12th Usenix Symposium on Operating Systems Design and Implementation (osdi '16). Graphene: Packing and Dependency-aware Scheduling for Data-parallel Clusters G: Packing and Dependency-aware Scheduling for Data-parallel Clusters , 2022 .
[14] Nikhil R. Devanur,et al. Market equilibrium via a primal--dual algorithm for a convex program , 2008, JACM.
[15] Janardhan Kulkarni,et al. Flow-time Optimization For Concurrent Open-Shop and Precedence Constrained Scheduling Models , 2018, APPROX-RANDOM.
[16] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[17] Shi Li,et al. Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[18] Kirk Pruhs,et al. Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling , 2011, WAOA.
[19] Robert E. Tarjan,et al. A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..
[20] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .