A Maiden Analysis of Longest Wait First

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 811-820

  Edmonds, Jeff ^a   Pruhs, Kirk ^b  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LONGEST WAIST FIRST (LWF); MAIDEN ANALYSIS;

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; BROADCASTING; FUNCTIONS; MULTICASTING; POISSON DISTRIBUTION; PROBLEM SOLVING; SCHEDULING; SERVERS;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 1842487292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. S. Aacharya, and S. Muthukrishnan, "Scheduling on-demand broadcasts: new metrics and algorithms", ACM/IEEE Int. Conf. on Mobile Computing and Networking, 43-54, 1998.
2. D. Aksoy, and M. Franklin, "Scheduling for large-scale on-demand data broadcasting", IEEE INFOCOM, 651-659, 1998.
3. M. H. Ammar, and J. W. Wong, "The design of teletext broadcast cycles", Performance Evaluation, 5(4), 235-242, 1985.
4. Y. Bartal, and S. Muthukrishnan, "Minimizing maximum response time in scheduling broadcasts", SODA, 558-559, 2000.
5. H.D. Dykeman, M. Ammar, and J.W. Wong, "Scheduling algorithms for videotex systems under broadcast delivery" IEEE International Conference on Communications, 1986.
6. J. Edmonds, "Scheduling in the dark", Theoretical Computer Science, 235(1), 109-141, 2000.
7. J. Edmonds and K. Pruhs, "Broadcast scheduling: when fairness is fine", SODA, 2002.
8. T. Erlebach and A. Hall, "Hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow", SODA, 2002.
9. R. Gandhi, S. Khuller, Y. Kim and Y-C. Wan, "Approximation algorithms for broadcast scheduling", IPCO, 425-438, 2002.
10. R. Gandhi, S. Khuller, S. Parthasarathy, A. Srinivasan, "Dependent rounding in bipartite graphs," FOCS, 2002.
11. A. Hall and H. Täubig, "Comparing push and pull-based broadcasting", WEA, 2003.
12. B. Kalyanasundaram, and K. Pruhs, "Speed is as powerful as clairvoyance", Journal of the ACM, 47(4), 617-643, 2000.
13. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, "Scheduling broadcasts in wireless networks", Journal of Scheduling, 4(6), 339-354, 2000.
14. H. Kaplan, R. Tarjan, K. Tsioutsiouliklis, "Faster kinetic heaps and their use in broadcast scheduling" SODA, 2001.
15. C. Phillips, C. Stein, E. Torng, and J. Wein "Optimal time-critical scheduling via resource augmentation", Algorithmica, 32(2), 163-200, 2002.
16. K. Pruhs, J. Sgall, and E. Torng, "On-line Scheduling", to appear in Handbook on Scheduling: Algorithms, Models and Performance Analysis, CRC press.
17. K. Pruhs and P. Uthaisombut, "A comparison of multicast pull models", ESA, 2002.
18. M.W. Wong, "Broadcast delivery", Proc. of the IEEE, 1566-1577, 1988.