Maryam Elahi
Carey Williamson
Abstract
In this paper, we study a variant of PS+PS multilevel scheduling, which we call the PS+IS queue. Specifically, we use Processor Sharing (PS) at both queues, but with linear frequency scaling on the second queue, so that the latter behaves like an Infinite Server (IS) queue. The goals of the system are low response times for small jobs in the first queue, and reduced power consumption for large jobs in the second queue. The novelty of our model includes the frequency scaling at the second queue, and the batch arrival process at the second queue induced by the busy period structure of the first queue which has strictly higher priority. We derive a numerical solution for the PS+IS queueing system in steady-state, and then study its properties under workloads obtained from fitting of TCP flow traces. The simulation results confirm the e
- S. Aalto and U. Ayesta. Mean delay analysis of multi level processor sharing disciplines. In Proc. IEEE of the 25th Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2006.Google Scholar
Cross Ref
- S. Aalto, U. Ayesta, and E. Nyberg-Oksanen. Two-level processor-sharing scheduling disciplines: Mean delay analysis. ACM SIGMETRICS Perf. Eval. Review, 32(1):97--105, 2004. Proc. of ACM SIGMETRICS/Performance.Google ScholarDigital Library
- E. Bachmat, J. Doncel, and H. Sarfati. Performance and stability analysis of the task assignment based on guessing size routing policy. In Proc. of Int. Symp. on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 1--13, 2019.Google ScholarCross Ref
- R. Botta, C. Harris, and W. Marchal. Characterizations of generalized hyperexponential disribution functions. Communications in Statistics. Stochastic Models, 3(1):115--148, 1987.Google ScholarCross Ref
- M. Elahi, A. Marin, S. Rossi, and C. Williamson. Frequency scaling in multilevel queues. Performance Evaluation, 143:102140, 2020.Google ScholarCross Ref
- I. Grosof, A. Scully, and M. Harchol-Balter. Load balancing guardrails: Keeping your heavy traffic on the road to low response times. Proc. of the ACM SIGMETRICS on Measurement and Analysis of Computing Systems (POMACS), 3(2):42:1--42:31, 2019.Google ScholarDigital Library
- I. Grosof, Z. Scully, and M. Harchol-Balter. SRPT for Multiserver Systems. Performance Evaluation, 127--128:154--175, 2018. Proc. of IFIP Performance.Google ScholarCross Ref
- L. Guo and I. Matta. Scheduling flows with unknown sizes: Approximate analysis. ACM SIGMETRICS Perf. Eval. Review, 30(1):276--277, 2002. Proc. of ACM SIGMETRICS.Google ScholarDigital Library
- L. Kleinrock. Queueing Systems, volume II: Computer Applications. Wiley Interscience, 1976.Google Scholar
- A. Marin, S. Rossi, M. Sottana, and C. Zen. Theoretical and experimental evaluation of the two-level processor sharing discipline for TCP flows. In Proc. of Int. Symp. on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 94--106, 2019.Google ScholarCross Ref
- I. Rai, G. Urvoy-Keller, M. Vernon, and E. Biersack. Performance analysis of LAS-based scheduling disciplines in a packet switched network. In Proc. of the ACM SIGMETRICS Int. Conf. on Measurement and modelling of computer systems, pages 106--117, 2004.Google ScholarDigital Library
- L. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16:678--690, 1968.Google ScholarDigital Library
Index Terms
- Frequency scaling in multilevel queues
Recommendations
Double-Sided Batch Queues with Abandonment: Modeling Crossing Networks
We study a double-sided queue with batch arrivals and abandonment. There are two types of customers, patient ones who queue but may later abandon, and impatient ones who depart immediately if their order is not filled. The system matches units from ...
Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue
In this paper, we study a discrete time queueing system with multiple types of customers and a first-come-first-served (FCFS) service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual customers ...
Analysis of a Discrete-Time Queueing System with Timed Vacations
We consider a discrete-time GI-G-1 queueing system with server vacations. Vacations occur whenever the queue becomes empty or whenever a timer expires. When the timer expires one of the following four actions are considered: the server completes ...
Comments