Bridging the Gap between Response Time and Energy-Efficiency in Broadcast Schedule Design

  • Wai Gen Yee
  • Shamkant B. Navathe
  • Edward Omiecinski
  • Christopher Jermaine
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2287)

Abstract

In this paper, we propose techniques for scheduling data broadcasts that are favorable in terms of both response and tuning time. In other words, these techniques ensure that a typical data request will be quickly satisfied and its reception will require a low client-side energy expenditure. By generating broadcast schedules based on Acharya et al.’s broadcast disk paradigm, we bridge the gap between these two mutually exclusive bodies of work—response time and energy expenditure. We prove the utility of our approach analytically and via experiments. Our analysis of optimal scheduling is presented under a variety of assumptions about size and popularity of data items, making our results generalizable to a range of applications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ammar, M.H., Wong, J.W.: The design of teletext broadcast cycles. Performance Evaluation 5 (1985) 235–242CrossRefGoogle Scholar
  2. 2.
    Herman, G., Gopal, G., Lee, K.C., Weinrib, A.: The datacycle architecture for very high throughput database systems. Proceedings of ACM SIGMOD International Conference on Management of Data (1987) 97–103Google Scholar
  3. 3.
    Aksoy, D., Franklin, M.: Scheduling for large-scale on-demand data broadcasting. Joint Conference Of The IEEE Computer and Communications Societies (1998)Google Scholar
  4. 4.
    Su, C.J., Tassiulas, L., Tsortras, V.J.: Broadcast scheduling for information distribution. Wireless Networks 5 (1999) 137–147CrossRefGoogle Scholar
  5. 5.
    Vaidya, N.H., Hameed, S.: Scheduling data broadcast in asymmetric communication environments. Wireless Networks 5 (1999) 171–182CrossRefGoogle Scholar
  6. 6.
    Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast disks: Data management for asymmetric communication environments. Proceedings of ACM SIGMOD International Conference on Management of Data (1995)Google Scholar
  7. 7.
    Su, C.J., Tassiulus, L.: Joint broadcast scheduling and user’s cache management for efficient information delivery. Wireless Networks 6 (2000) 279–288MATHCrossRefGoogle Scholar
  8. 8.
    Hu, Q., Lee, W.C., Lee, D.L.: Power conservative multi-attribute queries on data broadcast. In: Proceedings of the IEEE International Conference on Data Engineering. (1998)Google Scholar
  9. 9.
    Imielinski, T., Viswanathan, S., Badrinath, B.: Energy efficient indexing on air. Proceedings of ACM SIGMOD International Conference on Management of Data (1994)Google Scholar
  10. 10.
    Yee, W.G., Omiecinski, E., Navathe, S.B.: Efficient data allocation for broadcast disk arrays. Technical report, College of Computing, Georgia Institute of Technology (2001)Google Scholar
  11. 11.
    Shanmugasundaram, J., Nithrakashyap, A., Sivasankaran, R., Ramamritham, K.: Efficient concurrency control for broadcast environments. Proceedings of ACM SIGMOD International Conference on Management of Data (1999) 85–96Google Scholar
  12. 12.
    Datta, A., VanderMeer, D., Celik, A., Kumar, V.: Adaptive broadcast protocols to support efficient and energy conserving retrieval from databases in mobile computing environments. ACM Transactions on Database Systems 24 (1999)Google Scholar
  13. 13.
    Stathatos, K., Roussopoulos, N., Baras, J.S.: Adaptive data broadcast in hybrid networks. Proceedings of the International Conference on Very Large Databases (1997)Google Scholar
  14. 14.
    Bowen, T.F., Gopal, G., Herman, G., Hickey, T., Lee, K.C., Mansfield, W.H., Raitz, J., Weinrib, A.: The datacycle architecture. Communications of the ACM 35 (1992)Google Scholar
  15. 15.
    Peng, W.C., Chen, M.S.: Dynamic generation of data broadcasting programs for broadcast disk array in a mobile computing environment. Conference On Information And Knowledge Management (2000) 38–45Google Scholar
  16. 16.
    Konig, A.C., Weikum, G.: Combining histograms and parametric curve fitting for feedback-driven query result-size estimation. Proceedings of the International Conference on Very Large Databases (1999)Google Scholar
  17. 17.
    Navathe, S.B., Ceri, S., Wiederhold, G., Dou, J.: Vertical partitioning algorithms for database design. ACM Transactions on Database Systems 9 (1984)Google Scholar
  18. 18.
    Acharya, S., Franklin, M., Zdonik, S.: Disseminating updates on broadcast disks. Proceedings of the International Conference on Very Large Databases (1996)Google Scholar
  19. 19.
    Scheuermann, P., Weikum, G., Zabback, P.: Data partitioning and load balancing in parallel disk systems. The VLDB Journal 7 (1998) 48–66CrossRefGoogle Scholar
  20. 20.
    Lee, W.C., Hu, Q., Lee, D.L.: A study on channel allocation for data dissemination in mobile computing environments. The Journal of Mobile Networks and Applications 4 (1999) 117–129CrossRefGoogle Scholar
  21. 21.
    Fernandez, J., Ramamritham, K.: Adaptive dissemination of data in time-critical asymmetric communication environments. Proceedings of Euromicro Real-Time Systems Symposium (1999) 195–203Google Scholar
  22. 22.
    Acharya, S., Muthukrishnan, S.: Scheduling on-demand broadcasts: New metrics and algorithms. In: Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking. (1998)Google Scholar
  23. 23.
    Prabhakara, K., Hua, K.A., Oh, J.: Multi-level multi-channel air cache designs for broadcasting in a mobile environment. Proceedings of the IEEE International Conference on Data Engineering (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Wai Gen Yee
    • 1
  • Shamkant B. Navathe
    • 1
  • Edward Omiecinski
    • 1
  • Christopher Jermaine
    • 1
  1. 1.College of ComputingGeorgia Institute of TechnologyAtlanta

Personalised recommendations