Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
暂无分享,去创建一个
Amitabh Sinha | Jochen Könemann | Nikhil Bansal | Kedar Dhamdhere | N. Bansal | Amitabh Sinha | Kedar Dhamdhere | J. Könemann
[1] Tao Yang,et al. Scheduling optimization for resource-intensive Web requests on server clusters , 1999, SPAA '99.
[2] Rajeev Motwani,et al. Non-clairvoyant scheduling , 1994, SODA '93.
[3] Luca Becchetti,et al. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines , 2001, STOC '01.
[4] Gary J. Nutt. Operating system projects using Windows NT , 1998 .
[5] Nikhil Bansal,et al. Minimizing weighted flow time , 2007, ACM Trans. Algorithms.
[6] Abraham Silberschatz,et al. Operating System Concepts , 1983 .
[7] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[8] Rajmohan Rajaraman,et al. Improved algorithms for stretch scheduling , 2002, SODA '02.
[9] Luca Becchetti,et al. Scheduling to minimize average stretch without migration , 2000, SODA '00.
[10] Sanjeev Khanna,et al. Algorithms for minimizing weighted flow time , 2001, STOC '01.
[11] Bala Kalyanasundaram,et al. Minimizing flow time nonclairvoyantly , 2003, JACM.
[12] Mor Harchol-Balter,et al. Connection Scheduling in Web Servers , 1999, USENIX Symposium on Internet Technologies and Systems.
[13] Rajmohan Rajaraman,et al. Online Scheduling to Minimize Average Stretch , 2004, SIAM J. Comput..
[14] Yossi Azar,et al. Minimizing the Flow Time Without Migration , 2002, SIAM J. Comput..
[15] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[16] Kirk Pruhs,et al. Online weighted flow time and deadline scheduling , 2001, J. Discrete Algorithms.
[17] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[18] Michael A. Bender,et al. Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.