1. NCCU Academic Hub
  2. 學術產出
  3. 商學院
  4. 期刊論文
  5. Item

學術產出-期刊論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 Dynamic Scheduling for Switched Processing Systems with Substantial Service-mode Switching Times
作者 Hung,Ying-Chao;Chang,Chun-Chieh
貢獻者 統計系
日期 2008-09
上傳時間 23-十二月-2014 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
dc.contributor 統計系en_US
dc.creator (作者) Hung,Ying-Chao;Chang,Chun-Chiehen_US
dc.date (日期) 2008-09en_US
dc.date.accessioned 23-十二月-2014 15:19:46 (UTC+8)-
dc.date.available 23-十二月-2014 15:19:46 (UTC+8)-
dc.date.issued (上傳時間) 23-十二月-2014 15:19:46 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/72226-
dc.description.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..en_US
dc.format.extent 674322 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.relation (關聯) Queueing Systems: Theory and Applications,60(1),87-109en_US
dc.title (題名) Dynamic Scheduling for Switched Processing Systems with Substantial Service-mode Switching Timesen_US
dc.type (資料類型) articleen