A maiden analysis of longest wait first

We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always services the page where the aggregate waiting times of the outstanding requests for that page is maximized. We provide the first non-trivial analysis of the worst case performance of LWF. On the negative side, we show that LWF is not s-speed O(1)-competitive for s < 1+&sqrt;5/2. On the positive side, we show that LWF is 6-speed O(1)-competitive.

[1]  Jeff Edmonds,et al.  Scheduling in the dark , 1999, STOC '99.

[2]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[3]  Kirk Pruhs,et al.  Broadcast scheduling: when fairness is fine , 2002, SODA '02.

[4]  Mostafa H. Ammar,et al.  Scheduling Algorithms for Videotex Systems Under Broadcast Delivery , 1986, ICC.

[5]  Thomas Erlebach,et al.  NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow , 2002, SODA '02.

[6]  Kirk Pruhs,et al.  An optimized multicast-based data dissemination middleware: a demonstration , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[7]  Haim Kaplan,et al.  Faster kinetic heaps and their use in broadcast scheduling , 2001, SODA '01.

[8]  Alexander Hall,et al.  Comparing Push- and Pull-Based Broadcasting , 2003, WEA.

[9]  Rajiv Gandhi,et al.  Algorithms for Minimizing Response Time in Broadcast Scheduling , 2002, Algorithmica.

[10]  S. Muthukrishnan,et al.  Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.

[11]  ErlebachThomas,et al.  NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow , 2004 .

[12]  Jianliang Xu,et al.  Data broadcast , 2002 .

[13]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[14]  Joseph Naor,et al.  Approximating the average response time in broadcast scheduling , 2005, SODA '05.

[15]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[16]  J. Wong,et al.  Broadcast Delivery , 1988, Proc. IEEE.

[17]  Kirk Pruhs,et al.  Multicast Pull Scheduling: When Fairness Is Fine , 2003, Algorithmica.

[18]  S. Muthukrishnan,et al.  Scheduling on-demand broadcasts: new metrics and algorithms , 1998, MobiCom '98.

[19]  Rajiv Gandhi,et al.  Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[20]  Mostafa H. Ammar,et al.  The Design of Teletext Broadcast Cycles , 1985, Perform. Evaluation.

[21]  Hanjo Täubig,et al.  Comparing push- and pull-based broadcastingo or: would Microsoft watches profit from a transmitter? , 2003 .

[22]  Claire Mathieu,et al.  Polynomial-time approximation scheme for data broadcast , 2000, STOC '00.

[23]  Kirk Pruhs,et al.  Middleware support for multicast-based data dissemination: a working reality , 2003, Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003)..

[24]  Bala Kalyanasundaram,et al.  Scheduling Broadcasts in Wireless Networks , 2000, ESA.

[25]  Kirk Pruhs,et al.  A Comparison of Multicast Pull Models , 2002, Algorithmica.

[26]  Michael J. Franklin,et al.  Scheduling for large-scale on-demand data broadcasting , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.