Advertisement

A General Buffer Scheme for the Windows Scheduling Problem

  • Amotz Bar-Noy
  • Jacob Christensen
  • Richard E. Ladner
  • Tami Tamir
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)

Abstract

Broadcasting is an efficient alternative to unicast for delivering popular on-demand media requests. Windows scheduling algorithms provide a way to satisfy all requests with both low bandwidth and low latency. Consider a system of n pages that need to be scheduled (transmitted) on identical channels an infinite number of times. Time is slotted, and it takes one time slot to transmit each page. In the windows scheduling problem (WS) each page i, 1 ≤ in, is associated with a request window w i . In a feasible schedule for WS, page i must be scheduled at least once in any window of w i time slots. The objective function is to minimize the number of channels required to schedule all the pages. The main contribution of this paper is the design of a general buffer scheme for the windows scheduling problem such that any algorithm for WS follows this scheme. As a result, this scheme can serve as a tool to analyze and/or exhaust all possible WS-algorithms. The buffer scheme is based on modelling the system as a nondeterministic finite state channel in which any directed cycle corresponds to a legal schedule and vice-versa. Since WS is NP-hard, we present some heuristics and pruning-rules for cycle detection that ensure reasonable cycle-search time.

By introducing various rules, the buffer scheme can be transformed into deterministic scheduling algorithms. We show that a simple page-selection rule for the buffer scheme provides an optimal schedule to WS for the case where all the w i ’s have divisible sizes, and other good schedules for some other general cases. By using an exhaustive-search, we prove impossibility results for other important instances.

We also show how to extend the buffer scheme to more generalized environments in which (i) pages are arriving and departing on-line, (ii) the window constraint has some jitter, and (iii) different pages might have different lengths.

Keywords

Time Slot Feasible Schedule Directed Cycle Periodic Schedule Periodic Broadcast 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Acharya, S., Franklin, M.J., Zdonik, S.: Dissemination-based data delivery using broadcast disks. IEEE Personal Communications 2(6), 50–60 (1995)CrossRefGoogle Scholar
  2. 2.
    Ammar, M.H., Wong, J.W.: The design of teletext broadcast cycles. Performance Evaluation 5(4), 235–242 (1985)CrossRefGoogle Scholar
  3. 3.
    Anily, S., Glass, C.A., Hassin, R.: The scheduling of maintenance service. Discrete Applied Mathematics 82, 27–42 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Mathematics of Operations Research 27(3), 518–544 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SIAM Journal on Computing (SICOMP) 32(4), 1091–1113 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bar-Noy, A., Ladner, R.E., Tamir, T.: Scheduling techniques for media-on-demand. In: Proc. of the 14th SODA, pp. 791–800 (2003)Google Scholar
  7. 7.
    Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted bin-packing problem. In: Proc. of the 15th SODA, pp. 217–226 (2004)Google Scholar
  8. 8.
    Baruah, S.K., Lin, S.-S.: Pfair Scheduling of Generalized Pinwheel Task Systems. IEEE Trans. on Comp. 47, 812–816 (1998)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Chan, W.T., Wong, P.W.H.: On-line Windows Scheduling of Temporary Items. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 259–270. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Chan, M.Y., Chin, F.: General schedulers for the pinwheel problem based on double-integer reduction. IEEE Trans. on Computers 41, 755–768 (1992)CrossRefGoogle Scholar
  11. 11.
    Chan, M.Y., Chin, F.: Schedulers for larger classes of pinwheel instances. Algorithmica 9, 425–462 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Feinberg, E.A., Bender, M., Curry, M., Huang, D., Koutsoudis, T., Bernstein, J.: Sensor resource management for an airborne early warning radar. In: Proceedings of SPIE – The International Society of Optical Engineering, pp. 145–156 (2002)Google Scholar
  13. 13.
    Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: A real-time scheduling problem. In: Proc. of the 22nd Hawaii International Conf. on System Sciences, pp. 693–702 (1989)Google Scholar
  14. 14.
    Holte, R., Rosier, L., Tulchinsky, I., Varvel, D.: Pinwheel scheduling with two distinct numbers. Theoretical Computer Science 100, 105–135 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Hua, K.A., Sheu, S.: An efficient periodic broadcast technique for digital video libraries. Multimedia Tools and Applications 10, 157–177 (2000)CrossRefGoogle Scholar
  16. 16.
    Juhn, L., Tseng, L.: Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting 43(3), 268–271 (1997)CrossRefGoogle Scholar
  17. 17.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1), 46–61 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Pâris, J.F., Carter, S.W., Long, D.D.E.: A hybrid broadcasting protocol for video on demand. In: Proc. of the IS&T/SPIE Conference on Multimedia Computing and Networking, pp. 317–326 (1999)Google Scholar
  19. 19.
    Pâris, J.F.: A broadcasting protocol for video-on-demand using optional partial preloading. XIth International Conference on Computing I, 319–329 (2002)Google Scholar
  20. 20.
    Tijdeman, R.: The chairman assignment problem. Discrete Mathematics 32, 323–330 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Viswanathan, S., Imielinski, T.: Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal 4(3), 197–208 (1996)CrossRefGoogle Scholar
  22. 22.
    Wei, W., Liu, C.: On a periodic maintenance problem. Operations Res. Letters 2, 90–93 (1983)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Amotz Bar-Noy
    • 1
  • Jacob Christensen
    • 2
  • Richard E. Ladner
    • 2
  • Tami Tamir
    • 3
  1. 1.Computer and Information Science DepartmentBrooklyn CollegeBrooklyn
  2. 2.Department of Computer Science and EngineeringUniversity of WashingtonSeattle
  3. 3.School of Computer ScienceThe Interdisciplinary CenterHerzliyaIsrael

Personalised recommendations