A maiden analysis of Longest Wait First

Authors:
Jeff Edmonds;Kirk Pruhs
Affiliations:
York University, Canada;University of Pittsburgh
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 12
Cited 10

Scheduling on-demand broadcasts: new metrics and algorithms

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
R × W: a scheduling approach for large-scale on-demand data broadcast

IEEE/ACM Transactions on Networking (TON)
Minimizing maximum response time in scheduling broadcasts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Scheduling in the dark

Theoretical Computer Science - Selected papers in honor of Manuel Blum
Faster kinetic heaps and their use in broadcast scheduling

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling: when fairness is fine

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dependent Rounding in Bipartite Graphs

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Algorithms for Minimizing Response Time in Broadcast Scheduling

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Comparison of Multicast Pull Models

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Comparing push- and pull-based broadcastingo or: would "Microsoft watches" profit from a transmitter?

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms

Three dozen papers on online algorithms

ACM SIGACT News
Approximating the average response time in broadcast scheduling

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A robust maximum completion time measure for scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved approximation algorithms for broadcast scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Competitive online scheduling for server systems

ACM SIGMETRICS Performance Evaluation Review
Broadcast scheduling: algorithms and complexity

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
New models and algorithms for throughput maximization in broadcast scheduling

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Off-line algorithms for minimizing total flow time in broadcast scheduling

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A tight analysis of most-requested-first for on-demand data broadcast

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A near optimal scheduler for on-demand data broadcasts

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

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 O(1)-competitive.