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

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

45 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)83-99
Journal / PublicationReal-Time Systems
Volume34
Issue number2
Publication statusPublished - Oct 2006

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.

Research Area(s)

  • Mobile computing, On-demand broadcast, Preemption, Real-time scheduling algorithm

Citation Format(s)

Scheduling real-time requests in on-demand data broadcast environments. / Lee, Victor C. S.; Wu, Xiao; Ng, Joseph Kee-Yin.

In: Real-Time Systems, Vol. 34, No. 2, 10.2006, p. 83-99.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review