1. NCCU Academic Hub
  2. Publications
  3. College of Informatics
  4. Periodical Articles
  5. Item

Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Data Scheduling in Multiple Channel/Multiple Receiver Environments for Processing Data Requests with Timing Constraints
作者 陳良弼
LEE,GUANLING ;YI-NING PAN;ARBEE L. P. CHEN
貢獻者 資科系
關鍵詞 real-time database; timing constraint; periodic broadcast program; on_demand broadcast program; multiple broadcast channels
日期 2005
上傳時間 21-Aug-2014 14:55:06 (UTC+8)
摘要 In real-time environments, information is disseminated to clients under timing constraints. In this paper, we focus on the real time data scheduling problem in multiple broadcast channels environments, where the clients are equipped with multiple receivers. Each request is associated with a deadline. The clients can either retrieve data items from the broadcast channels or send requests to the server and then listen to the broadcast channels. The aim of our work is to serve as many requests as possible. In our approach, the content of the broadcast program is first decided. Afterwards, the proposed periodic broadcast program generation algorithm and the on-demand broadcast program generation algorithm are employed. Simulations were performed to show the benefit of our approach. We conclude that our data scheduling algorithms are scalable, and that the time spent on executing our data scheduling algorithms is low. Moreover, when our data scheduling algorithms are used, the percentage of requests that miss their deadlines is also low.
關聯 JOURNAL OF INFORMATION SCIENCE AND ENGINEERING,21,1179-1199
資料類型 article
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) LEE,GUANLING ;YI-NING PAN;ARBEE L. P. CHENen_US
dc.date (日期) 2005en_US
dc.date.accessioned 21-Aug-2014 14:55:06 (UTC+8)-
dc.date.available 21-Aug-2014 14:55:06 (UTC+8)-
dc.date.issued (上傳時間) 21-Aug-2014 14:55:06 (UTC+8)-
dc.identifier.uri (URI) https://ah.lib.nccu.edu.tw/item?item_id=77570-
dc.description.abstract (摘要) In real-time environments, information is disseminated to clients under timing constraints. In this paper, we focus on the real time data scheduling problem in multiple broadcast channels environments, where the clients are equipped with multiple receivers. Each request is associated with a deadline. The clients can either retrieve data items from the broadcast channels or send requests to the server and then listen to the broadcast channels. The aim of our work is to serve as many requests as possible. In our approach, the content of the broadcast program is first decided. Afterwards, the proposed periodic broadcast program generation algorithm and the on-demand broadcast program generation algorithm are employed. Simulations were performed to show the benefit of our approach. We conclude that our data scheduling algorithms are scalable, and that the time spent on executing our data scheduling algorithms is low. Moreover, when our data scheduling algorithms are used, the percentage of requests that miss their deadlines is also low.en_US
dc.format.extent 245551 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.relation (關聯) JOURNAL OF INFORMATION SCIENCE AND ENGINEERING,21,1179-1199en_US
dc.subject (關鍵詞) real-time database; timing constraint; periodic broadcast program; on_demand broadcast program; multiple broadcast channelsen_US
dc.title (題名) Data Scheduling in Multiple Channel/Multiple Receiver Environments for Processing Data Requests with Timing Constraintsen_US
dc.type (資料類型) articleen