| dc.contributor | 統計系 | en_US |
| dc.creator (作者) | Hung, Ying-Chao;Michailidis, George ; Arbor,Ann | en_US |
| dc.date (日期) | 2008-07 | en_US |
| dc.date.accessioned | 23-Dec-2014 15:19:58 (UTC+8) | - |
| dc.date.available | 23-Dec-2014 15:19:58 (UTC+8) | - |
| dc.date.issued (上傳時間) | 23-Dec-2014 15:19:58 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/72227 | - |
| dc.description.abstract (摘要) | Switched Processing Systems (SPS) serve as canonical models in a wide area of applications such as high performance computing, wireless networking, call centers, and flexible manufacturing. In this article, we model the SPS by considering both slotted and continuous time and analyze it under fairly mild stochastic assumptions. Two classes of scheduling policies are introduced and shown to maximize the throughput and maintain strong stability of the system. In addition, their performance with respect to the average job sojourn time is examined by simulating small SPS subject to different types of input traffic. By utilizing the simulation result of the proposed policies, a hybrid control policy is constructed to reduce the average job sojourn time when the system has unknown and changing input loads. | en_US |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | ACM Transactions on Modeling and Computer Simulation, 8(3), Article 12 | en_US |
| dc.title (題名) | Modeling Scheduling and Simulation of Switched Processing Systems | en_US |
| dc.type (資料類型) | article | en |
