Skip to main content
SpringerLink
Log in

Longest Wait First for Broadcast Scheduling [Extended Abstract]

  • Conference paper
Approximation and Online Algorithms (WAOA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5893))

Included in the following conference series:

Abstract

We consider online algorithms for broadcast scheduling. In the pull-based broadcast model there are n unit-sized pages of information at a server and requests arrive online for pages. When the server transmits a page p, all outstanding requests for that page are satisfied. There is a lower bound of Ω(n) on the competitiveness of online algorithms to minimize average flow-time; therefore we consider resource augmentation analysis in which the online algorithm is given extra speed over the adversary. The longest-wait-first (LWF) algorithm is a natural algorithm that has been shown to have good empirical performance [2]. Edmonds and Pruhs showed that LWF is 6-speed O(1)-competitive using a novel yet complex analysis; they also showed that LWF is not O(1)-competitive with less than 1.618-speed. In this paper we make two main contributions to the analysis of LWF and broadcast scheduling.

  • We give an intuitive and easy to understand analysis of LWF which shows that it is O(1/ε 2)-competitive for average flow-time with (4 + ε) speed.

  • We show that a natural extension of LWF is O(1)-speed O(1)-competitive for more general objective functions such as average delay-factor and L k norms of delay-factor (for fixed k). These metrics generalize average flow-time and L k norms of flow-time respectively and ours are the first non-trivial results for these objective functions in broadcast scheduling.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acharya, S., Franklin, M., Zdonik, S.: Dissemination-based data delivery using broadcast disks. IEEE Pers. Commun. 2(6), 50–60 (1995)

    Article  Google Scholar 

  2. Aksoy, D., Franklin, M.J.: rxw: A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Trans. Netw. 7(6), 846–860 (1999)

    Article  Google Scholar 

  3. Bansal, N., Charikar, M., Khanna, S., Naor, J.S.: Approximating the average response time in broadcast scheduling. In: SODA, pp. 215–221 (2005)

    Google Scholar 

  4. Bansal, N., Coppersmith, D., Sviridenko, M.: Improved approximation algorithms for broadcast scheduling. In: SODA, pp. 344–353 (2006)

    Google Scholar 

  5. Bansal, N., Pruhs, K.: Server scheduling in the l p norm: a rising tide lifts all boat. In: STOC, pp. 242–250 (2003)

    Google Scholar 

  6. Bar-Noy, A., Bhatia, R., Naor, J.S., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. Oper. Res. 27(3), 518–544 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: SODA, pp. 558–559 (2000)

    Google Scholar 

  8. Bender, M.A., Clifford, R., Tsichlas, K.: Scheduling algorithms for procrastinators. J. Scheduling 11(2), 95–104 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: algorithms and complexity. In: SODA, pp. 473–482 (2008)

    Google Scholar 

  10. Chekuri, C., Moseley, B.: Online scheduling to minimize the maximum delay factor. In: SODA, pp. 1116–1125 (2009)

    Google Scholar 

  11. Edmonds, J.: Scheduling in the dark. Theor. Comput. Sci. 235(1), 109–141 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Edmonds, J., Pruhs, K.: Multicast pull scheduling: When fairness is fine. Algorithmica 36(3), 315–330 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Edmonds, J., Pruhs, K.: A maiden analysis of longest wait first. ACM Trans. Algorithms 1(1), 14–32 (2005)

    Article  MathSciNet  Google Scholar 

  14. Edmonds, J., Pruhs, K.: Scalably scheduling processes with arbitrary speedup curves. In: SODA, pp. 685–692 (2009)

    Google Scholar 

  15. Erlebach, T., Hall, A.: Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In: SODA, pp. 194–202 (2002)

    Google Scholar 

  16. Gandhi, R., Khuller, S., Kim, Y.-A., Wan, Y.-C.J.: Algorithms for minimizing response time in broadcast scheduling. Algorithmica 38(4), 597–608 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324–360 (2006)

    Article  MathSciNet  Google Scholar 

  18. Hall, A., Täubig, H.: Comparing push- and pull-based broadcasting. or: Would “microsoft watches” profit from a transmitter? In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol. 2647, pp. 148–164. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  19. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. J. Scheduling 4(6), 339–354 (2000)

    Article  MathSciNet  Google Scholar 

  21. Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev. 34(4), 52–58 (2007)

    Article  Google Scholar 

  22. Wong, J.: Broadcast delivery. Proc. IEEE 76(12), 1566–1577 (1988)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Illinois, Urbana, IL 61801

    Chandra Chekuri, Sungjin Im & Benjamin Moseley

Authors
  1. Chandra Chekuri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sungjin Im
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Benjamin Moseley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Place des Terasses, Tour Evry 2, 91000, Evry Cedex, France

    Evripidis Bampis

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chekuri, C., Im, S., Moseley, B. (2010). Longest Wait First for Broadcast Scheduling [Extended Abstract]. In: Bampis, E., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2009. Lecture Notes in Computer Science, vol 5893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12450-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12450-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12449-5

  • Online ISBN: 978-3-642-12450-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation