交換處理系統在許多應用領域如通訊、電腦、及製造業方面扮演著相當重要的角色。它的重要特徵是具有彈性、相互關聯的伺服器及具有不同類別的交通流量。早期的研究重點皆放在如何使系統的吞吐量為最大，近年來，越來越多的研究已轉移到如何改善系統的服務品質(如工作延時，積存量等)。在此計劃中，我們首先提出一個以測量為基準的動態服務策略來顯著改善系統工作的延時表現。此方法乃給與每個系統佇列一最適當的「權重」 並使得著名的「最大乘積控制策略」在一連串的時間點上可滿足一組線性歸化問題的解。這一連串的時間點乃偵測交通流量強度有「顯著」變化之處，並由一統計方法所監控。當系統的伺服器交換成本被慎重考慮時，我們也提出了另一個控制策略。其想法與動機來自於所謂「最短處理時間優先」(SPTF) 的法則。最後，透過電腦模擬我們也將評估所提策略在不同的系統、不同類型的輸入交通下之表現。 Switched Processing Systems (SPS) represent a canonical model for many areas of applications of communication, computer and manufacturing systems. They are characterized by flexible, interdependent service capabilities and multiple classes of job traffic flows. Recently, increased attention has been paid to the issue of improving quality of service (QoS) performance in terms of delays and backlogs of the associated scheduling policies, rather than simply maximizing the system's throughput. In this study, we investigate a measurement based dynamic service allocation policy that significantly improves performance with respect to delay metrics. The proposed policy is to associate an 「optimal」 weight with each queue so that the well-known MaxProduct policy solves a linear program at selected points in time that are in turn determined by a statistical monitoring strategy that detects 「significant」 changes in the input traffic intensities. For systems where switching costs are strictly considered, an alternative policy motivated by the idea of the Shortest Processing Time First (SPTF) rule is introduced. The performances of the proposed strategies are illustrated on small SPS subject to different types of input traffic. 研究期間：9608~ 9707
