Hung Y.-CMichailidis G.YING-CHAO HUNG2022-11-112022-11-11200705361486https://www.scopus.com/inward/record.uri?eid=2-s2.0-38549149671&doi=10.1109%2fICC.2007.57&partnerID=40&md5=4670eaa376ab8fd070cb3d39c375f2e3https://scholars.lib.ntu.edu.tw/handle/123456789/625041Switched 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 solves a linear program at selected points in time that are in turn determined by a monitoring strategy that detects 'significant' changes in the intensities of the input processes. The proposed strategy is illustrated on a small SPS subject to different types of input traffic. ©2007 IEEE.Dynamic service allocation; Job traffic flows; Switched Processing Systems (SPS); Linear programming; Problem solving; Quality of service; Telecommunication services; Telecommunication traffic; Switching networksconference paper10.1109/ICC.2007.572-s2.0-38549149671