English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 89672/119493 (75%)
Visitors : 23942406      Online Users : 172
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/69138
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/69138


    Title: Data Scheduling in Multiple Channel/Multiple Receiver Environments for Processing Data Requests with Timing Constraints
    Authors: 陳良弼
    LEE,GUANLING;YI-NING PAN;ARBEE L. P. CHEN
    Contributors: 資科系
    Keywords: real-time database;timing constraint;periodic broadcast program;on_demand broadcast program;multiple broadcast channels
    Date: 2005
    Issue Date: 2014-08-21 14:55:06 (UTC+8)
    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.
    Relation: JOURNAL OF INFORMATION SCIENCE AND ENGINEERING,21,1179-1199
    Data Type: article
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    1179-1199.pdf239KbAdobe PDF619View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback