Online scalable scheduling for the lk-norms of flow time without conservation of work
暂无分享,去创建一个
[1] Kirk Pruhs,et al. Scheduling jobs with varying parallelizability to reduce variance , 2010, SPAA '10.
[2] Randeep Bhatia,et al. Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.
[3] Benjamin Moseley,et al. Longest Wait First for Broadcast Scheduling , 2009, ArXiv.
[4] Thomas Erlebach,et al. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow , 2001 .
[5] Nikhil Bansal,et al. Better Scalable Algorithms for Broadcast Scheduling , 2010, ICALP.
[6] Kirk Pruhs,et al. A maiden analysis of longest wait first , 2005, TALG.
[7] R. Serfozo,et al. Optimal control of batch service queues , 1973, Advances in Applied Probability.
[8] Joseph Naor,et al. Approximating the average response time in broadcast scheduling , 2005, SODA '05.
[9] Kirk Pruhs,et al. Scalably scheduling processes with arbitrary speedup curves , 2009, TALG.
[10] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[11] Samir Khuller,et al. Broadcast scheduling: Algorithms and complexity , 2008, TALG.
[12] Kirk Pruhs,et al. Server scheduling in the Lp norm: a rising tide lifts all boat , 2003, STOC '03.
[13] Jeff Edmonds,et al. Scheduling in the dark , 1999, STOC '99.
[14] Rajiv Gandhi,et al. Algorithms for Minimizing Response Time in Broadcast Scheduling , 2002, Algorithmica.
[15] Xiaotie Deng,et al. Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics , 2003, J. Sched..
[16] Michael J. Franklin,et al. On-Demand Broadcast Scheduling , 1999 .
[17] Rajiv Gandhi,et al. Algorithms for Minimizing Response Time in Broadcast Scheduling , 2002, IPCO.
[18] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[19] Thomas Erlebach,et al. NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow , 2002, SODA '02.
[20] Alexander Hall,et al. Comparing Push- and Pull-Based Broadcasting , 2003, WEA.
[21] S. Muthukrishnan,et al. Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.
[22] Benjamin Moseley,et al. Longest Wait First for Broadcast Scheduling [Extended Abstract] , 2009, WAOA.
[23] Bala Kalyanasundaram,et al. Scheduling Broadcasts in Wireless Networks , 2000, ESA.
[24] Julien Robert,et al. Non-clairvoyant scheduling with precedence constraints , 2008, SODA '08.
[25] Peter B. Galvin,et al. Operating System Concepts, 4th Ed. , 1993 .
[26] Kirk Pruhs,et al. Multicast Pull Scheduling: When Fairness Is Fine , 2003, Algorithmica.
[27] Rajiv Gandhi,et al. Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[28] Kirk Pruhs,et al. Speed scaling of processes with arbitrary speedup curves on a multiprocessor , 2009, SPAA '09.
[29] Nikhil Bansal,et al. Improved approximation algorithms for broadcast scheduling , 2006, SODA '06.
[30] Kirk Pruhs,et al. Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability , 2010, WAOA.
[31] Stanley B. Zdonik,et al. Dissemination-based data delivery using broadcast disks , 1995, IEEE Wirel. Commun..
[32] Benjamin Moseley,et al. An online scalable algorithm for average flow time in broadcast scheduling , 2010, SODA '10.
[33] V. N. Muralidhara,et al. A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation , 2009, STOC '09.