A maiden analysis of longest wait first-Reference-Cited by-同舟云学术

A maiden analysis of longest wait first

Published:2005-07 Issue:1 Volume:1 Page:14-32
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Edmonds Jeff¹,Pruhs Kirk²

Affiliation:

1. York University, Toronto, Ontario, Canada

2. University of Pittsburgh, Pittsburgh, PA

Abstract

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+√5/2. On the positive side, we show that LWF is 6-speed O (1)-competitive.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1077464.1077467

Reference23 articles.

1. Scheduling on-demand broadcasts

2. Aksoy D. and Franklin M. J. 1998. Scheduling for large-scale on-demand data broadcasting. In INFOCOM. 651--659. Aksoy D. and Franklin M. J. 1998. Scheduling for large-scale on-demand data broadcasting. In INFOCOM. 651--659.

3. The design of teletext broadcast cycles

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Better Scalable Algorithms for Broadcast Scheduling;ACM Transactions on Algorithms;2014-10-28

2. Scheduling to minimize energy and flow time in broadcast scheduling;Journal of Scheduling;2014-03-05

3. An online scalable algorithm for average flow time in broadcast scheduling;ACM Transactions on Algorithms;2012-09

4. Better Scalable Algorithms for Broadcast Scheduling;Automata, Languages and Programming;2010

5. Longest Wait First for Broadcast Scheduling [Extended Abstract];Approximation and Online Algorithms;2010