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

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

43 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 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.

Original languageEnglish
Pages (from-to)83-99
Number of pages17
JournalReal-Time Systems
Volume34
Issue number2
DOIs
Publication statusPublished - Oct 2006

Scopus Subject Areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Computer Science Applications
  • Computer Networks and Communications
  • Control and Optimization
  • Electrical and Electronic Engineering

User-Defined Keywords

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

Fingerprint

Dive into the research topics of 'Scheduling real-time requests in on-demand data broadcast environments'. Together they form a unique fingerprint.

Cite this