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

Xiao Wu; Victor C.S. Lee; Joseph Kee Yin Ng

doi:10.1109/RTCSA.2005.13

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

Xiao Wu^*, Victor C.S. Lee, Joseph Kee Yin Ng

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

6 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 language	English
Title of host publication	Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Pages	17-22
Number of pages	6
DOIs	https://doi.org/10.1109/RTCSA.2005.13
Publication status	Published - 2005
Event	11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - Hong Kong, China Duration: 17 Aug 2005 → 19 Aug 2005

Publication series

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

Conference

Conference	11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Country/Territory	China
City	Hong Kong
Period	17/08/05 → 19/08/05

Scopus Subject Areas

Engineering(all)

Access to Document

10.1109/RTCSA.2005.13

Cite this

Wu, X., Lee, V. C. S., & Ng, J. K. Y. (2005). A preemptive scheduling algorithm for wireless real-time on-demand data broadcast. In Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (pp. 17-22). Article 1541051 (Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications). https://doi.org/10.1109/RTCSA.2005.13

Wu, Xiao ; Lee, Victor C.S. ; Ng, Joseph Kee Yin. / A preemptive scheduling algorithm for wireless real-time on-demand data broadcast. Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 2005. pp. 17-22 (Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications).

@inproceedings{bbe5fbf122c14247b012bbf313502b6e,

title = "A preemptive scheduling algorithm for wireless real-time on-demand data broadcast",

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.",

author = "Xiao Wu and Lee, {Victor C.S.} and Ng, {Joseph Kee Yin}",

note = "Copyright: Copyright 2011 Elsevier B.V., All rights reserved.; 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications ; Conference date: 17-08-2005 Through 19-08-2005",

year = "2005",

doi = "10.1109/RTCSA.2005.13",

language = "English",

isbn = "0769523463",

series = "Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications",

pages = "17--22",

booktitle = "Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications",

}

Wu, X, Lee, VCS & Ng, JKY 2005, A preemptive scheduling algorithm for wireless real-time on-demand data broadcast. in Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications., 1541051, Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 17-22, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Hong Kong, China, 17/08/05. https://doi.org/10.1109/RTCSA.2005.13

A preemptive scheduling algorithm for wireless real-time on-demand data broadcast. / Wu, Xiao; Lee, Victor C.S.; Ng, Joseph Kee Yin.
Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 2005. p. 17-22 1541051 (Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

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

AU - Wu, Xiao

AU - Lee, Victor C.S.

AU - Ng, Joseph Kee Yin

PY - 2005

Y1 - 2005

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

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

UR - http://www.scopus.com/inward/record.url?scp=33749079169&partnerID=8YFLogxK

U2 - 10.1109/RTCSA.2005.13

DO - 10.1109/RTCSA.2005.13

M3 - Conference proceeding

AN - SCOPUS:33749079169

SN - 0769523463

SN - 9780769523460

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

SP - 17

EP - 22

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

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

Y2 - 17 August 2005 through 19 August 2005

ER -

Wu X, Lee VCS, Ng JKY. A preemptive scheduling algorithm for wireless real-time on-demand data broadcast. In Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 2005. p. 17-22. 1541051. (Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications). doi: 10.1109/RTCSA.2005.13

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

Abstract

Publication series

Conference

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this