Skip to main content
Log in

Scheduling real-time requests in on-demand data broadcast environments

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

On-demand broadcast is an attractive data dissemination method for mobile and wireless computing. In this paper, we propose a new online preemptive scheduling algorithm, called PRDS that incorporates urgency, data size and number of pending requests for real-time on-demand broadcast system. Furthermore, we use pyramid preemption to optimize performance and reduce overhead. A series of simulation experiments have been performed to evaluate the real-time performance of our algorithm as compared with other previously proposed methods. The experimental results show that our algorithm substantially outperforms other algorithms over a wide range of workloads and parameter settings.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Acharya S, Alonaso R, Franklin M, Zdonik S (1995a) Broadcast Disks: Data management for asymmetric communications environments. In: Carey MJ, Schneider DA (eds) Proceeding of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, pp199–210 22–25 May 1995

  • Acharya S, Franklin M, Zdonik S (1995b) Dissemination-based data delivery using broadcast disks. IEEE Personal Communications 2:50–60

    Article  Google Scholar 

  • Acharya S, Franklin M, Zdonik S (1997) Balancing push and pull for data broadcast. In Proc. of ACM SIGMOD, Tucson, AZ, pp253–258, May 1997

  • Acharya S, Muthukrishnan S (1998) Scheduling On-demand broadcasts: New metrics and algorithms. ACM MobiCom’98, pp43–54

  • Aksoy D, Franklin M (1999) RxW: A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions on Networking 7(6)

    Article  Google Scholar 

  • Baruah S, Bestavros A (1997) Pinwheel scheduling for fault tolerant broadcast disks in real-time database systems. In proc. of the 13th International Conference on Data Engineering, pp543–551

  • Bestavros A (1996) AIDA-based Real-time fault-tolerant broadcast disks. In Proc. The 3rd IEEE Real-Time Technology and Applications Symp. (RTAS’96), Boston, MA, pp 49–58

  • Crespo A, Buyukkokten O, Garcia-Molina H (2003) Query merging: Improving query subscription processing in a multicast environment. IEEE Transactions on Knowledge and Data Engineering 15(1):174–191

    Article  Google Scholar 

  • Fernandez J, Ramamritham K (2004) Adaptive dissemination of data in time-critical asymmetric communication environments. Mobile Networks and Applications 9:491–505

    Article  Google Scholar 

  • Hameed S, Vaidya NH (1999) Efficient algorithms for scheduling data broadcast. ACM/Baltzer Journal of Wireless Network 5(3):183–193

    Article  Google Scholar 

  • Haritsa JR, Carey MJ, Livny M (1992) Data access scheduling in firm real-time database systems. Real-Time Systems 4(3):203–241

    Article  Google Scholar 

  • Hui Chui Ying, Ng Joseph K, Lee Victor CS (2005) On-demand broadcast algorithms with caching on improving response time for real-time information dispatch systems. In Proceedings of the 11th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), Hong Kong, pp285–288, 17–19 Aug 2005

  • Jiang S, Vaidya NH (1999) Scheduling data broadcast to impatient users. In Proc. Int. Workshop on Data Engineering for Wireless and Mobile Access (MobiDE’99), Seattle, WA, Aug 1999

  • Kalyanasundaram B, Velauthapillai M (2003) On-demand broadcasting under deadline. In The 11th Annual European Symposium on Algorithms (ESA 2003), pp313–324

  • Kim JH, Chowa KY (2003) Scheduling broadcasts with deadlines. In COCOON. pp415–424

  • Lam K-Y, Chan E, Yuen JC-H (2000) Approaches for Broadcasting temporal data in mobile computing systems. Journal of Systems and Software, pp195–203

  • Lee G, Pan Y-N, Chen A (2002) Scheduling real-time data items in multiple channels and multiple receivers environments. In Proc. of the 22nd International Conference on Distributed Computing Systems (ICDCS’02)

  • Lin C-W, Lee DL (2000) Adaptive data delivery in wireless communication environments. In Proceedings of the 20th International Conference on Distributed Computing Systems (ICDCS ‘2000), Taipei, Taiwan, April

  • Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in hard real-time environments. J. of ACM, 20(1):46–61

    Article  MATH  MathSciNet  Google Scholar 

  • Ng Joseph K, Xu Jian Liang (2004) On-demand broadcast algorithm on improving response time for real-time information dispatch system. In Proceedings of the 10th International Conference on Real-Time and Embedded Computing Systems and Applications (RTCSA 2004), Gothenburg, Sweden, pp573–590, Aug 25–27,

  • Schwetman H (1998) CSIM user’s guide (Version 18). MCC Corporation, http://www.mesquite.com

  • Sharaf MA, Chrysanthis PK (2002) On-demand broadcast: New challenges and scheduling algorithms. The first Hellenic Data Management Symposium Electronic Proceeding (HDMS’02) Athens, Hellas, July 2002

  • Shih C-S, Liu WS (2002) State-dependent deadline scheduling. In Proc. The 23rd IEEE Real-Time Systems Symp. (RTSS’02), December 1998

  • Su CJ, Tassiulas L, Tsotras VJ (1999) Broadcast scheduling for information distribution. ACM/Baltzer Journal of Wireless Networks 5(2):137–147

    Article  Google Scholar 

  • Vaidya NH, Hameed S (1999) Scheduling data broadcast in asymmetric communication environments. ACM/Baltzer Journal of Wireless Networks 5(3):171–182

    Article  Google Scholar 

  • Viswanathan S, Imielinski T (1995) Pyramid broadcasting for video on demand service. In Proc. of the IEEE Multimedia Computing and Networks Conference

  • Wong JW (1988) Broadcast Delivery. In Proceedings of IEEE 76(12):1566–1577

    Article  Google Scholar 

  • Wu Y, Cao G (2001) Stretch-optimal scheduling for on-demand data broadcasts. IEEE International Conference on Computer Communications and Networks (ICCCN’01), pp500–504 Oct 1995

  • Xu J, Hu Q, Lee DL, Lee W-C (2000) SAIU: An efficient cache replacement policy for wireless on-demand broadcasts. In Proc. The 9th ACM Int. Conf. on Information and Knowledge Management (CIKM ‘00), McLean, VA, USA, pp46–53

  • Xu J, Hu Q, Lee DL, Lee W-C (2003a) Performance evaluation of an optimal cache replacement policy for wireless data dissemination. IEEE Trans. on Knowledge and Data Engineering (TKDE)

  • Xu J, Tang X, Lee W-C (2003b) Time-critical on-demand broadcast: Algorithms, analysis, and performance evaluation. Technical report

  • Xuan P, Sen S, Gonzalez O, Fernandez J, Ramamritham K (1997) Broadcast on demand: efficient and timely dissemination of data in mobile environments. IEEE Real-Time Technology and Applications Symposium pp38–48 June 1997

  • Zhang F (2000) Real-time broadcast on demand: Towards timely data dissemination in mobile environment. Project report

  • Zipf GK (1949) Human Behavior and the Principle of Least Effort. Addison-Wesley, Massachusetts

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Victor C. S. Lee.

Additional information

The work described in this paper was partially supported by grants from CityU (Project No. 7001841) and RGC CERG Grant No. HKBU 2174/03E.

This paper is an extended version of the paper “A preemptive scheduling algorithm for wireless real-time on-demand data broadcast” that appeared in the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

Victor C. S. Lee received his Ph.D. degree in Computer Science from the City University of Hong Kong in 1997. He is now an Assistant Professor in the Department of Computer Science of the City University of Hong Kong. Dr. Lee is a member of the ACM, the IEEE and the IEEE Computer Society. He is currently the Chairman of the IEEE, Hong Kong Section, Computer Chapter. His research interests include real-time data management, mobile computing, and transaction processing.

Xiao Wu received the B.Eng. and M.S. degrees in computer science from Yunnan University, Kunming, China, in 1999 and 2002, respectively. He is currently a Ph.D. candidate in the Department of Computer Science at the City University of Hong Kong. He was with the Institute of Software, Chinese Academy of Sciences, Beijing, China, between January 2001 and July 2002. From 2003 to 2004, he was with the Department of Computer Science of the City University of Hong Kong, Hong Kong, as a Research Assistant. His research interests include multimedia information retrieval, video computing and mobile computing.

Joseph Kee-Yin NG received a B.Sc. in Mathematics and Computer Science, a M.Sc. in Computer Science, and a Ph.D. in Computer Science from the University of Illinois at Urbana-Champaign in the years 1986, 1988, and 1993, respectively. Prof. Ng is currently a professor in the Department of Computer Science at Hong Kong Baptist University.

His current research interests include Real-Time Networks, Multimedia Communications, Ubiquitous/Pervasive Computing, Mobile and Location- aware Computing, Performance Evaluation, Parallel and Distributed Computing. Prof. Ng is the Technical Program Chair for TENCON 2006, General Co-Chair for The 11th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), Program Vice Chair for The 11th International Conference on Parallel and Distributed Systems (ICPADS 2005), Program Area-Chair for The 18th & 19th International Conference on Advanced Information Networking and Applications (AINA 2004 & AINA 2005), General Co-Chair for The International Computer Congress 1999 & 2001 (ICC’99 & ICC’01), Program Co-Chair for The Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA’99) and General Co-Chair for The 1999 and 2001 International Computer Science Conference (ICSC’99 & ICSC’01).

Prof. Ng is a member of the Editorial Board of Journal of Pervasive Computing and Communications, Journal of Ubiquitous Computing and Intelligence, Journal of Embedded Computing, and Journal of Microprocessors and Microsystems. He is the Associate Editor of Real-Time Systems Journal and Journal of Mobile Multimedia. He is also a guest editor of International Journal of Wireless and Mobile Computing for a special issue on Applications, Services, and Infrastructures for Wireless and Mobile Computing.

Prof. Ng is currently the Region 10 Coordinator for the Chapter Activities Board of the IEEE Computer Society, and is the Coordinator of the IEEE Computer Society Distinguished Visitors Program (Asia/Pacific). He is a senior member of the IEEE and has been a member of the IEEE Computer Society since 1991. Prof. Ng has been an Exco-member (1993–95), General Secretary (1995–1997), Vice-Chair (1997–1999), Chair (1999–2001) and the Past Chair of the IEEE, Hong Kong Section, Computer Chapter. Prof. Ng received the Certificate of Appreciation for Services and Contribution (2004) from IEEE Hong Kong Section, the Certificate of Appreciation for Leadership and Service (2000–2001) from IEEE Region 10 and the IEEE Meritorious Service Award from IEEE Computer Society at 2004. He is also a member of the IEEE Communication Society, ACM and the Founding Member for the Internet Society (ISOC)-Hong Kong Chapter.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, V.C.S., Wu, X. & Ng, J.KY. Scheduling real-time requests in on-demand data broadcast environments. Real-Time Syst 34, 83–99 (2006). https://doi.org/10.1007/s11241-006-7982-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-006-7982-5

Keywords

Navigation