English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 92429/122733 (75%)
Visitors : 26351068      Online Users : 711
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/72226
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/72226

    Title: Dynamic Scheduling for Switched Processing Systems with Substantial Service-mode Switching Times
    Authors: Hung,Ying-Chao;Chang,Chun-Chieh
    Contributors: 統計系
    Date: 2008-09
    Issue Date: 2014-12-23 15:19:46 (UTC+8)
    Abstract: 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..
    Relation: Queueing Systems: Theory and Applications,60(1),87-109
    Data Type: article
    Appears in Collections:[統計學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    87-109.pdf658KbAdobe PDF837View/Open

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback