Multi-processor scheduling to minimize flow time with ε resource augmentation
暂无分享,去创建一个
Ashish Goel | Amit Kumar | Sanjeev Khanna | Chandra Chekuri | S. Khanna | Ashish Goel | Amit Kumar | C. Chekuri
[1] Michael A. Bender,et al. Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.
[2] Stefano Leonardi,et al. Approximating total flow time on parallel machines , 1997, STOC '97.
[3] Noga Alon,et al. Approximation schemes for scheduling , 1997, SODA '97.
[4] Yossi Azar,et al. Ancient and New Algorithms for Load Balancing in the lp Norm , 1998, SODA '98.
[5] Rajeev Motwani,et al. Non-clairvoyant scheduling , 1994, SODA '93.
[6] Luca Becchetti,et al. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines , 2001, STOC '01.
[7] Sanjeev Khanna,et al. Approximation schemes for preemptive weighted flow time , 2002, STOC '02.
[8] Nikhil Bansal,et al. Minimizing weighted flow time , 2007, ACM Trans. Algorithms.
[9] Mor Harchol-Balter,et al. Web servers under overload: How scheduling can help , 2006, TOIT.
[10] Yossi Azar,et al. Minimizing the flow time without migration , 1999, STOC '99.
[11] Kirk Pruhs,et al. Online weighted flow time and deadline scheduling , 2001, J. Discrete Algorithms.
[12] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[13] Ming-Yang Kao,et al. Load balancing in the L/sub p/ norm , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[14] Yossi Azar,et al. Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching , 2003, SPAA '03.
[15] Kirk Pruhs,et al. Server scheduling in the Lp norm: a rising tide lifts all boat , 2003, STOC '03.
[16] Sanjeev Khanna,et al. Algorithms for minimizing weighted flow time , 2001, STOC '01.
[17] Cynthia A. Phillips,et al. Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.
[18] Luca Becchetti,et al. Scheduling to minimize average stretch without migration , 2000, SODA '00.
[19] Cynthia A. Phillips,et al. Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.
[20] Jirí Sgall,et al. Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines , 1999, ESA.
[21] B. Awerbuch,et al. Load Balancing in the Lp Norm , 1995, FOCS 1995.
[22] References , 1971 .
[23] Mor Harchol-Balter,et al. Connection Scheduling in Web Servers , 1999, USENIX Symposium on Internet Technologies and Systems.
[24] Rajmohan Rajaraman,et al. Online scheduling to minimize average stretch , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[25] Mor Harchol-Balter,et al. Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.