An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
暂无分享,去创建一个
[1] Kirk Pruhs,et al. Scalably scheduling processes with arbitrary speedup curves , 2009, TALG.
[2] Mor Harchol-Balter. The Case for SRPT Scheduling in Web Servers , 1998 .
[3] Amit Kumar,et al. Minimizing Average Flow-time : Upper and Lower Bounds , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[4] Yossi Azar,et al. Minimizing total flow time and total completion time with immediate dispatching , 2003, SPAA.
[5] Rajmohan Rajaraman,et al. Improved algorithms for stretch scheduling , 2002, SODA '02.
[6] Luca Becchetti,et al. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines , 2004, JACM.
[7] Benjamin Moseley,et al. An online scalable algorithm for average flow time in broadcast scheduling , 2010, SODA '10.
[8] V. N. Muralidhara,et al. A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation , 2009, STOC '09.
[9] Abraham Silberschatz,et al. Operating System Concepts, 5th Edition , 1994 .
[10] Kirk Pruhs,et al. Scheduling jobs with varying parallelizability to reduce variance , 2010, SPAA '10.
[11] Kirk Pruhs. Competitive online scheduling for server systems , 2007, PERV.
[12] Amit Kumar,et al. Minimizing average flow time on related machines , 2006, STOC '06.
[13] Yossi Azar,et al. Minimizing the flow time without migration , 1999, STOC '99.
[14] Nikhil Bansal,et al. Weighted flow time does not admit O(1)-competitive algorithms , 2009, SODA.
[15] Ashish Goel,et al. Multi-processor scheduling to minimize flow time with ε resource augmentation , 2004, STOC '04.
[16] Michael A. Bender,et al. Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.
[17] Jeff Edmonds. Scheduling in the dark , 2000, Theor. Comput. Sci..
[18] Benjamin Moseley,et al. Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling , 2009, ESA.
[19] Cynthia A. Phillips,et al. Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.
[20] Benjamin Moseley,et al. Longest Wait First for Broadcast Scheduling , 2009, ArXiv.
[21] Benjamin Moseley,et al. Longest Wait First for Broadcast Scheduling [Extended Abstract] , 2009, WAOA.
[22] Amit Kumar,et al. Better Algorithms for Minimizing Average Flow-Time on Related Machines , 2006, ICALP.
[23] Benjamin Moseley,et al. Online scheduling to minimize the maximum delay factor , 2008, SODA.
[24] Stefano Leonardi,et al. Approximating total flow time on parallel machines , 2007, J. Comput. Syst. Sci..
[25] Kirk Pruhs,et al. Online weighted flow time and deadline scheduling , 2006, J. Discrete Algorithms.
[26] Peter B. Galvin,et al. Operating System Concepts, 4th Ed. , 1993 .
[27] Kirk Pruhs,et al. Server Scheduling in the Weighted lp Norm , 2004, LATIN.
[28] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[29] Kirk Pruhs,et al. Server scheduling in the Lp norm: a rising tide lifts all boat , 2003, STOC '03.