Scheduling dependent items in data broadcasting environments

Hao Ping Hung; Jen Wei Huang; Jung Long Huang; Ming Syan Chen

doi:10.1145/1141277.1141555

Scheduling dependent items in data broadcasting environments

Hao Ping Hung, Jen Wei Huang, Jung Long Huang, Ming Syan Chen

Department of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

16 Citations (Scopus)

Abstract

Most of the prior research works in data broadcasting are based on the assumption that the disseminated items are independent of one another. Since in many applications, a mobile user will be interested in more than one item simultaneously, we discuss in this paper the issue of dependency in generating a broadcast program. Algorithm PBA, standing for Placement-Based Allocation, is proposed to generate a broadcast program with high quality and low complexity in the dependent data broadcasting environment. The experimental results show that the proposed placement-based allocation for scheduling dependent items leads to better execution efficiency and solution quality than those by prior works.

Original language	English
Title of host publication	Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing
Publisher	Association for Computing Machinery
Pages	1177-1181
Number of pages	5
ISBN (Print)	1595931082, 9781595931085
DOIs	https://doi.org/10.1145/1141277.1141555
Publication status	Published - 2006
Event	2006 ACM Symposium on Applied Computing - Dijon, France Duration: 2006 Apr 23 → 2006 Apr 27

Publication series

Name	Proceedings of the ACM Symposium on Applied Computing
Volume	2

Other

Other	2006 ACM Symposium on Applied Computing
Country/Territory	France
City	Dijon
Period	06-04-23 → 06-04-27

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.1145/1141277.1141555

Cite this

Hung, H. P., Huang, J. W., Huang, J. L., & Chen, M. S. (2006). Scheduling dependent items in data broadcasting environments. In Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing (pp. 1177-1181). (Proceedings of the ACM Symposium on Applied Computing; Vol. 2). Association for Computing Machinery. https://doi.org/10.1145/1141277.1141555

Hung, Hao Ping ; Huang, Jen Wei ; Huang, Jung Long ; Chen, Ming Syan. / Scheduling dependent items in data broadcasting environments. Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing. Association for Computing Machinery, 2006. pp. 1177-1181 (Proceedings of the ACM Symposium on Applied Computing).

@inproceedings{88e434b33a5045ef9db522650f600148,

title = "Scheduling dependent items in data broadcasting environments",

abstract = "Most of the prior research works in data broadcasting are based on the assumption that the disseminated items are independent of one another. Since in many applications, a mobile user will be interested in more than one item simultaneously, we discuss in this paper the issue of dependency in generating a broadcast program. Algorithm PBA, standing for Placement-Based Allocation, is proposed to generate a broadcast program with high quality and low complexity in the dependent data broadcasting environment. The experimental results show that the proposed placement-based allocation for scheduling dependent items leads to better execution efficiency and solution quality than those by prior works.",

author = "Hung, {Hao Ping} and Huang, {Jen Wei} and Huang, {Jung Long} and Chen, {Ming Syan}",

year = "2006",

doi = "10.1145/1141277.1141555",

language = "English",

isbn = "1595931082",

series = "Proceedings of the ACM Symposium on Applied Computing",

publisher = "Association for Computing Machinery",

pages = "1177--1181",

booktitle = "Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing",

note = "2006 ACM Symposium on Applied Computing ; Conference date: 23-04-2006 Through 27-04-2006",

}

Hung, HP, Huang, JW, Huang, JL & Chen, MS 2006, Scheduling dependent items in data broadcasting environments. in Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing. Proceedings of the ACM Symposium on Applied Computing, vol. 2, Association for Computing Machinery, pp. 1177-1181, 2006 ACM Symposium on Applied Computing, Dijon, France, 06-04-23. https://doi.org/10.1145/1141277.1141555

Scheduling dependent items in data broadcasting environments. / Hung, Hao Ping; Huang, Jen Wei; Huang, Jung Long; Chen, Ming Syan.

Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing. Association for Computing Machinery, 2006. p. 1177-1181 (Proceedings of the ACM Symposium on Applied Computing; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Scheduling dependent items in data broadcasting environments

AU - Hung, Hao Ping

AU - Huang, Jen Wei

AU - Huang, Jung Long

AU - Chen, Ming Syan

PY - 2006

Y1 - 2006

N2 - Most of the prior research works in data broadcasting are based on the assumption that the disseminated items are independent of one another. Since in many applications, a mobile user will be interested in more than one item simultaneously, we discuss in this paper the issue of dependency in generating a broadcast program. Algorithm PBA, standing for Placement-Based Allocation, is proposed to generate a broadcast program with high quality and low complexity in the dependent data broadcasting environment. The experimental results show that the proposed placement-based allocation for scheduling dependent items leads to better execution efficiency and solution quality than those by prior works.

AB - Most of the prior research works in data broadcasting are based on the assumption that the disseminated items are independent of one another. Since in many applications, a mobile user will be interested in more than one item simultaneously, we discuss in this paper the issue of dependency in generating a broadcast program. Algorithm PBA, standing for Placement-Based Allocation, is proposed to generate a broadcast program with high quality and low complexity in the dependent data broadcasting environment. The experimental results show that the proposed placement-based allocation for scheduling dependent items leads to better execution efficiency and solution quality than those by prior works.

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

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

U2 - 10.1145/1141277.1141555

DO - 10.1145/1141277.1141555

M3 - Conference contribution

AN - SCOPUS:33751060997

SN - 1595931082

SN - 9781595931085

T3 - Proceedings of the ACM Symposium on Applied Computing

SP - 1177

EP - 1181

BT - Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing

PB - Association for Computing Machinery

T2 - 2006 ACM Symposium on Applied Computing

Y2 - 23 April 2006 through 27 April 2006

ER -

Hung HP, Huang JW, Huang JL, Chen MS. Scheduling dependent items in data broadcasting environments. In Applied Computing 2006 - The 21st Annual ACM Symposium on Applied Computing - Proceedings of the 2006 ACM Symposium on Applied Computing. Association for Computing Machinery. 2006. p. 1177-1181. (Proceedings of the ACM Symposium on Applied Computing). https://doi.org/10.1145/1141277.1141555

Scheduling dependent items in data broadcasting environments

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this