A preemptive scheduling algorithm for wireless real-time on-demand data broadcast

Xiao Wu*, Victor C.S. Lee, Joseph K Y NG

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

5 Citations (Scopus)

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 the urgency, the data size and the number of pending requests for real-time on-demand broadcast system. Furthermore, we use pyramid preemption to optimize performance and reduce overhead. We have done a series of simulation experiments to evaluate the performance of our algorithm as compared with other previously proposed methods under a range of scenarios. The experimental results show that our algorithm can substantially outperform other algorithms without jeopardizing other performance metrics, such as response time and stretch.

Original languageEnglish
Title of host publicationProceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Pages17-22
Number of pages6
DOIs
Publication statusPublished - 2005
Event11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - Hong Kong, China
Duration: 17 Aug 200519 Aug 2005

Publication series

NameProceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Conference

Conference11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Country/TerritoryChina
CityHong Kong
Period17/08/0519/08/05

Scopus Subject Areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'A preemptive scheduling algorithm for wireless real-time on-demand data broadcast'. Together they form a unique fingerprint.

Cite this