政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/72226
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 113648/144635 (79%)
造访人次 : 51597023      在线人数 : 811
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 商學院 > 統計學系 > 期刊論文 >  Item 140.119/72226


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/72226


    题名: Dynamic Scheduling for Switched Processing Systems with Substantial Service-mode Switching Times
    作者: Hung,Ying-Chao;Chang,Chun-Chieh
    贡献者: 統計系
    日期: 2008-09
    上传时间: 2014-12-23 15:19:46 (UTC+8)
    摘要: Switched Processing Systems (SPS) represent canonical models for many communication and computer systems. Over the years, much research has been devoted to developing the best scheduling policies to optimize the various performance metrics of interest. These policies have mostly originated from the well-known MaxWeight discipline, which at any point in time switches the system into the service mode possessing “maximal matching” with the system state (e.g., queue-length, workload, etc.). However, for simplicity it is often assumed that the switching times between service modes are “negligible”—but this proves to be impractical in some applications. In this study, we propose a new scheduling strategy (called the Dynamic Cone Policy) for SPS, which includes substantial service-mode switching times. The goal is to maximize throughput and maintain system stability under fairly mild stochastic assumptions. For practical purposes, an extended scheduling strategy (called the Practical Dynamic Cone Policy) is developed to reduce the computational complexity of the Dynamic Cone Policy and at the same time mitigate job delay. A simulation study shows that the proposed practical policy clearly outperforms another throughput-maximizing policy called BatchAdapt, both in terms of the average and the 95th percentile of job delay for various types of input traffic..
    關聯: Queueing Systems: Theory and Applications,60(1),87-109
    数据类型: article
    显示于类别:[統計學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    87-109.pdf658KbAdobe PDF21101检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈