On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems
Queueing Systems: Theory and Applications
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Queueing analysis of network traffic: methodology and visualization tools
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
Dynamic scheduling for switched processing systems with substantial service-mode switching times
Queueing Systems: Theory and Applications
Computational Statistics & Data Analysis
Contour estimation via two fidelity computer simulators under limited resources
Computational Statistics
Hi-index | 0.00 |
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.