A general framework for handling commitment in online throughput maximization
暂无分享,去创建一个
Lin Chen | Nicole Megow | Kevin Schewior | Clifford Stein | Franziska Eberle | C. Stein | Nicole Megow | Kevin Schewior | Franziska Eberle | Lin Chen
[1] Srikanth Kandula,et al. Jockey: guaranteed job latency in data parallel clusters , 2012, EuroSys '12.
[2] Bhaskar DasGupta,et al. Online real-time preemptive scheduling of jobs with deadlines , 2000, APPROX.
[3] Joseph Naor,et al. On-line admission control and packet scheduling with interleaving , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[4] Joseph Naor,et al. Efficient online scheduling for deadline-sensitive jobs: extended abstract , 2013, SPAA.
[5] Domenico Ferrari,et al. Exact admission control for networks with a bounded delay service , 1996, TNET.
[6] Sandy Irani,et al. Bounding the power of preemption in randomized scheduling , 1995, STOC '95.
[7] Benjamin Moseley,et al. Scheduling Parallelizable Jobs Online to Maximize Throughput , 2018, LATIN.
[8] Dennis Shasha,et al. MOCA: A Multiprocessor On-Line Competitive Algorithm for Real-Time System Scheduling , 1994, Theor. Comput. Sci..
[9] Abhay Parekh,et al. Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.
[10] Sanjoy K. Baruah,et al. On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.
[11] Yossi Azar,et al. Truthful Online Scheduling with Commitments , 2015, EC.
[12] Benjamin Moseley,et al. General Profit Scheduling and the Power of Migration on Heterogeneous Machines , 2016, SPAA.
[13] Sanjoy K. Baruah,et al. Scheduling for Overload in Real-Time Systems , 1997, IEEE Trans. Computers.
[14] Bala Kalyanasundaram,et al. Maximizing job completions online , 1998, J. Algorithms.
[15] Uwe Schwiegelshohn,et al. The Power of Migration for Online Slack Scheduling , 2016, ESA.
[16] Kirk Pruhs,et al. How to Schedule When You Have to Buy Your Energy , 2010, APPROX-RANDOM.
[17] Michael H. Goldwasser. Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control , 1999, SODA '99.
[18] Nicole Megow,et al. A general framework for handling commitment in online throughput maximization , 2020, Math. Program..
[19] Sanjoy K. Baruah,et al. On-line scheduling to maximize task completions , 1994, 1994 Proceedings Real-Time Systems Symposium.
[20] Dennis Shasha,et al. D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..
[21] Richard J. Lipton,et al. Online interval scheduling , 1994, SODA '94.
[22] Gerhard J. Woeginger,et al. On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..
[23] Kirk Pruhs,et al. Competitive Algorithms for Due Date Scheduling , 2007, Algorithmica.
[24] Lin Chen,et al. An O(log m)-Competitive Algorithm for Online Machine Minimization , 2015, SODA.
[25] Lin Chen,et al. The Power of Migration in Online Machine Minimization , 2016, SPAA.