none
碩士 === 國立中央大學 === 統計研究所 === 94 === Abstract Switched processing systems have received a lot of attentions in the past years. Over the last decade, research has been focused on how to obtain the maximal throughput of the system by constructing optimal scheduling policies. Recently, a well know cla...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/erzt8t |
| Summary: | 碩士 === 國立中央大學 === 統計研究所 === 94 === Abstract
Switched processing systems have received a lot of attentions in the past years. Over the last decade, research has been focused on how to obtain the maximal throughput of the system by constructing optimal scheduling policies. Recently, a well know class of MaxProduct policies have been shown to maximize the throughput and maintain rate stability of the system. However, simulation studies showed that this policy can lose a huge capacity (throughput) when the switch time between service modes is strictly considered. In this study, we propose an algorithm which modifies the MaxProduct policy by dynamically rearranging the decision cones according to the queue-length states. We also perform a simulation study to show that the proposed approach can diametrically increase the throughput of the system when the switch time is considered.
|
|---|