Cart (Loading....) | Create Account
Close category search window

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Xiao Wu ; Dept. of Comput. Sci., City Univ. of Hong Kong, China ; Lee, V.C.S. ; Ng, J.K.-Y.

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.

Published in:

Embedded and Real-Time Computing Systems and Applications, 2005. Proceedings. 11th IEEE International Conference on

Date of Conference:

17-19 Aug. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.