Dynamic priority scheduling of periodic queries in on-demand data dissemination systems

Quan Zhou, Guohui Li, Jianjun Li, Lih Chyun Shu, Cong Zhang, Fumin Yang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

As an important wireless data broadcast technique, on-demand broadcast has been widely used for dynamic and large-scale data dissemination. An important class of emerging data broadcast applications requires monitoring multiple data items continuously in order to support data-driven decision making. Since wireless bandwidth is a precious shared medium, an important problem to solve is how to disseminate data to periodic queries, so that all the requests can be satisfied while the bandwidth consumption is minimized. In this paper, we first propose a new real-time scheduling algorithm called EDFS, which is a variant of the classic EDF [24] algorithm. Based on EDFS, we propose a novel on-line broadcast scheduling algorithm, called EDFS-BS. To our best knowledge, EDFS-BS is the first dynamic priority based broadcast scheduling algorithm that can be utilized to satisfy the timing constraints of periodic queries. We also propose a bandwidth utilization based schedulability test for EDFS-BS, which is used to ensure timing predictability of a periodic query set. Extensive experiments have been conducted to compare EDFS-BS versus existing solutions with comparable quality. The results show that EDFS-BS outperforms them considerably in terms of wireless bandwidth consumption and query service ratio.

Original languageEnglish
Pages (from-to)58-70
Number of pages13
JournalInformation Systems
Volume67
DOIs
Publication statusPublished - 2017 Jul 1

Fingerprint

Scheduling algorithms
Scheduling
Bandwidth
Decision making
Monitoring
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

Zhou, Quan ; Li, Guohui ; Li, Jianjun ; Shu, Lih Chyun ; Zhang, Cong ; Yang, Fumin. / Dynamic priority scheduling of periodic queries in on-demand data dissemination systems. In: Information Systems. 2017 ; Vol. 67. pp. 58-70.
@article{223edbf2df374223a2747c48d5652b3d,
title = "Dynamic priority scheduling of periodic queries in on-demand data dissemination systems",
abstract = "As an important wireless data broadcast technique, on-demand broadcast has been widely used for dynamic and large-scale data dissemination. An important class of emerging data broadcast applications requires monitoring multiple data items continuously in order to support data-driven decision making. Since wireless bandwidth is a precious shared medium, an important problem to solve is how to disseminate data to periodic queries, so that all the requests can be satisfied while the bandwidth consumption is minimized. In this paper, we first propose a new real-time scheduling algorithm called EDFS, which is a variant of the classic EDF [24] algorithm. Based on EDFS, we propose a novel on-line broadcast scheduling algorithm, called EDFS-BS. To our best knowledge, EDFS-BS is the first dynamic priority based broadcast scheduling algorithm that can be utilized to satisfy the timing constraints of periodic queries. We also propose a bandwidth utilization based schedulability test for EDFS-BS, which is used to ensure timing predictability of a periodic query set. Extensive experiments have been conducted to compare EDFS-BS versus existing solutions with comparable quality. The results show that EDFS-BS outperforms them considerably in terms of wireless bandwidth consumption and query service ratio.",
author = "Quan Zhou and Guohui Li and Jianjun Li and Shu, {Lih Chyun} and Cong Zhang and Fumin Yang",
year = "2017",
month = "7",
day = "1",
doi = "10.1016/j.is.2017.03.005",
language = "English",
volume = "67",
pages = "58--70",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",

}

Dynamic priority scheduling of periodic queries in on-demand data dissemination systems. / Zhou, Quan; Li, Guohui; Li, Jianjun; Shu, Lih Chyun; Zhang, Cong; Yang, Fumin.

In: Information Systems, Vol. 67, 01.07.2017, p. 58-70.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dynamic priority scheduling of periodic queries in on-demand data dissemination systems

AU - Zhou, Quan

AU - Li, Guohui

AU - Li, Jianjun

AU - Shu, Lih Chyun

AU - Zhang, Cong

AU - Yang, Fumin

PY - 2017/7/1

Y1 - 2017/7/1

N2 - As an important wireless data broadcast technique, on-demand broadcast has been widely used for dynamic and large-scale data dissemination. An important class of emerging data broadcast applications requires monitoring multiple data items continuously in order to support data-driven decision making. Since wireless bandwidth is a precious shared medium, an important problem to solve is how to disseminate data to periodic queries, so that all the requests can be satisfied while the bandwidth consumption is minimized. In this paper, we first propose a new real-time scheduling algorithm called EDFS, which is a variant of the classic EDF [24] algorithm. Based on EDFS, we propose a novel on-line broadcast scheduling algorithm, called EDFS-BS. To our best knowledge, EDFS-BS is the first dynamic priority based broadcast scheduling algorithm that can be utilized to satisfy the timing constraints of periodic queries. We also propose a bandwidth utilization based schedulability test for EDFS-BS, which is used to ensure timing predictability of a periodic query set. Extensive experiments have been conducted to compare EDFS-BS versus existing solutions with comparable quality. The results show that EDFS-BS outperforms them considerably in terms of wireless bandwidth consumption and query service ratio.

AB - As an important wireless data broadcast technique, on-demand broadcast has been widely used for dynamic and large-scale data dissemination. An important class of emerging data broadcast applications requires monitoring multiple data items continuously in order to support data-driven decision making. Since wireless bandwidth is a precious shared medium, an important problem to solve is how to disseminate data to periodic queries, so that all the requests can be satisfied while the bandwidth consumption is minimized. In this paper, we first propose a new real-time scheduling algorithm called EDFS, which is a variant of the classic EDF [24] algorithm. Based on EDFS, we propose a novel on-line broadcast scheduling algorithm, called EDFS-BS. To our best knowledge, EDFS-BS is the first dynamic priority based broadcast scheduling algorithm that can be utilized to satisfy the timing constraints of periodic queries. We also propose a bandwidth utilization based schedulability test for EDFS-BS, which is used to ensure timing predictability of a periodic query set. Extensive experiments have been conducted to compare EDFS-BS versus existing solutions with comparable quality. The results show that EDFS-BS outperforms them considerably in terms of wireless bandwidth consumption and query service ratio.

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

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

U2 - 10.1016/j.is.2017.03.005

DO - 10.1016/j.is.2017.03.005

M3 - Article

AN - SCOPUS:85016330419

VL - 67

SP - 58

EP - 70

JO - Information Systems

JF - Information Systems

SN - 0306-4379

ER -