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

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.

[1]  Krithi Ramamritham,et al.  Broadcast on demand: efficient and timely dissemination of data in mobile environments , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[2]  Nitin H. Vaidya,et al.  Scheduling data broadcast to “impatient” users , 1999, MobiDe '99.

[3]  Jianliang Xu,et al.  Performance evaluation of an optimal cache replacement policy for wireless data dissemination , 2004, IEEE Transactions on Knowledge and Data Engineering.

[4]  Joseph Kee-Yin Ng,et al.  On-demand broadcast algorithms with caching on improving response time for real time information dispatch systems , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

[5]  Jae-Hoon Kim,et al.  Scheduling broadcasts with deadlines , 2003, Theor. Comput. Sci..

[6]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[7]  Mohamed A. Sharaf,et al.  On-Demand Broadcast: New Challenges and Scheduling Algorithms , 2002 .

[8]  S. Muthukrishnan,et al.  Scheduling on-demand broadcasts: new metrics and algorithms , 1998, MobiCom '98.

[9]  Dik Lun Lee,et al.  Adaptive data delivery in wireless communication environments , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[10]  Nitin H. Vaidya,et al.  Scheduling data broadcast in asymmetric communication environments , 1999, Wirel. Networks.

[11]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[12]  Sanjoy K. Baruah,et al.  Pinwheel scheduling for fault-tolerant broadcast disks in real-time database systems , 1997, Proceedings 13th International Conference on Data Engineering.

[13]  Rafael Alonso,et al.  Broadcast Disks: Data Management for Asymmetric Communication Environments , 1994, Mobidata.

[14]  V. D.,et al.  Prof , 1973 .

[15]  Chi-Sheng Shih,et al.  State-dependent deadline scheduling , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[16]  Bala Kalyanasundaram,et al.  On-Demand Broadcasting Under Deadline , 2003, ESA.

[17]  Stanley B. Zdonik,et al.  Balancing push and pull for data broadcast , 1997, SIGMOD '97.

[18]  Miron Livny,et al.  Data access scheduling in firm real-time database systems , 1992, Real-Time Systems.

[19]  Tomasz Imielinski,et al.  Pyramid broadcasting for video-on-demand service , 1995, Electronic Imaging.

[20]  Hector Garcia-Molina,et al.  Query Merging: Improving Query Subscription Processing in a Multicast Environment , 2003, IEEE Trans. Knowl. Data Eng..

[21]  Jianliang Xu,et al.  So Kin Ming Time-Critical On-Demand Broadcast : Algorithms , Analysis , and Performance Evaluation , 2003 .

[22]  Leandros Tassiulas,et al.  Broadcast scheduling for information distribution , 1999, Wirel. Networks.

[23]  Nitin H. Vaidya,et al.  Efficient algorithms for scheduling data broadcast , 1999 .

[24]  Arbee L. P. Chen,et al.  Scheduling real-time data items in multiple channels and multiple receivers environments , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[25]  Krithi Ramamritham,et al.  Adaptive Dissemination of Data in Time-Critical Asymmetric Communication Environments , 2004, Mob. Networks Appl..

[26]  Jianliang Xu,et al.  SAIU: an efficient cache replacement policy for wireless on-demand broadcasts , 2000, CIKM '00.

[27]  J. Wong,et al.  Broadcast Delivery , 1988, Proc. IEEE.

[28]  Edward Chan,et al.  Approaches for broadcasting temporal data in mobile computing systems , 2000, J. Syst. Softw..

[29]  Azer Bestavros,et al.  AIDA-based real-time fault-tolerant broadcast disks , 1996, Proceedings Real-Time Technology and Applications.

[30]  Stanley B. Zdonik,et al.  Dissemination-based data delivery using broadcast disks , 1995, IEEE Wirel. Commun..

[31]  Guohong Cao,et al.  Stretch-optimal scheduling for on-demand data broadcasts , 2001 .

[32]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[33]  Michael J. Franklin,et al.  On-Demand Broadcast Scheduling , 1999 .