Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud
暂无分享,去创建一个
[1] Dennis Shasha,et al. D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..
[2] Benjamin Hindman,et al. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.
[3] Sanjeev Khanna,et al. On multi-dimensional packing problems , 2004, SODA '99.
[4] Francis Y. L. Chin,et al. Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? , 2003, Algorithmica.
[5] Vaibhav Srivastava,et al. Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization , 2014, Eur. J. Oper. Res..
[6] Ariel D. Procaccia,et al. No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.
[7] Ness B. Shroff,et al. Forget the Deadline: Scheduling Interactive Applications in Data Centers , 2015, 2015 IEEE 8th International Conference on Cloud Computing.
[8] Joseph Naor,et al. The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..
[9] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[10] Ishai Menache,et al. Efficient online scheduling for deadline-sensitive jobs: extended abstract , 2013, SPAA.
[11] Boaz Patt-Shamir,et al. Buffer overflow management in QoS switches , 2001, STOC '01.
[12] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .
[13] Mung Chiang,et al. Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework , 2013, TNET.
[14] Joseph Naor,et al. Efficient online scheduling for deadline-sensitive jobs: extended abstract , 2013, SPAA.
[15] Adam Wierman,et al. USENIX Association 11 th USENIX Symposium on Networked Systems Design and Implementation 289 GRASS : Trimming Stragglers in Approximation Analytics , 2014 .
[16] Bruce Hajek. On the Competitiveness of On-Line Scheduling of Unit-Length Packets with Hard Deadlines in Slotted Time , 2001 .
[17] Bala Shetty,et al. The nonlinear knapsack problem - algorithms and applications , 2002, Eur. J. Oper. Res..
[18] Ness B. Shroff,et al. Online welfare maximization for electric vehicle charging with electricity cost , 2014, e-Energy.
[19] Berthold Vöcking,et al. Approximation techniques for utilitarian mechanism design , 2005, STOC '05.
[20] Zongpeng Li,et al. An online auction framework for dynamic resource provisioning in cloud computing , 2014, SIGMETRICS '14.
[21] Kirk Pruhs,et al. Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling , 2011, WAOA.
[22] Sanjeev Khanna,et al. On Multidimensional Packing Problems , 2004, SIAM J. Comput..
[23] Ariel D. Procaccia,et al. Beyond Dominant Resource Fairness , 2015, ACM Trans. Economics and Comput..
[24] Marek Chrobak,et al. Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs , 2004, STACS.
[25] Zongpeng Li,et al. Dynamic resource provisioning in cloud computing: A randomized auction approach , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.
[26] James R. Larus,et al. Zeta: scheduling interactive services with partial execution , 2012, SoCC '12.
[27] Nikhil R. Devanur,et al. Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms , 2014, ACM Trans. Algorithms.
[28] Dennis Shasha,et al. D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systems , 1992, [1992] Proceedings Real-Time Systems Symposium.
[29] Nodari Vakhania,et al. Preemptive Scheduling in Overloaded Systems , 2002, ICALP.
[31] Joseph Naor,et al. Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters , 2012, SPAA '12.
[32] C ParkesDavid,et al. Beyond Dominant Resource Fairness , 2015 .
[33] Ee-Chien Chang,et al. Competitive Online Scheduling with Level of Service , 2001, COCOON.
[34] Ee-Chien Chang,et al. Competitive On-Line Scheduling with Level of Service , 2003, J. Sched..