The Multiserver-Job Stochastic Recurrence Equation for Cloud Computing Performance Evaluation
Open Access
- 26 March 2026
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 10 (1) , 1-25
Abstract
Cloud computing data centers handle highly variable workloads: job resource requirements can range from just one or few cores to thousands, and job service times can range from milliseconds to hours or days. This variability significantly limits the maximum achievable utilization of infrastructures. Queuing theory has addressed the study of these systems with the definition of the Multiserver-Job Queuing Model (MJQM), where s identical servers are present and job n requires α n of the s servers for a random amount of time σ n . The α n servers are occupied and released simultaneously. Unfortunately, despite its simple formulation, the MJQM remains elusive. For example, the MJQM stability condition has been derived only in particular cases. As a consequence, even applying Discrete-Event Simulation (DES) under high load becomes challenging, because stability cannot be determined a priori. In this paper, we analyze the MJQM with general independent arrival processes and service times under FCFS scheduling, using stochastic recurrence equations (SREs) and ergodic theory. Starting from the definition of the MJQM SRE, we prove the monotonicity and separability properties that allow us to apply an extension of Loynes' theorem, known as the monotone-separable framework, and formally define the MJQM stability condition. From these results, we introduce and implement two algorithms: the first one is used to draw sub-perfect samples (SPS) of the system's workload and the second one estimates the system's stability condition given the statistics of the jobs' input stream. The nature of the SPS algorithm allows for a massive GPU parallelization, thus greatly improving the efficiency in the estimation of performance metrics. The algorithm for the estimation of the stability condition solves an important problem for the analysis of MJQMs. We also define new metrics that capture the synchronization loss in MJQM systems and we show how these metrics can be efficiently evaluated using the SRE approach. Finally, we show that the approach proposed in this paper can be extended to more complicated systems, including MJQMs where resources have types.Keywords
All Related Versions
Funding Information
- TECoSA Vinnova Center (2024-03717)
- ERC NEMO (788851)
- TUCAN6-CM (TEC-2024\/COM-460)
This publication has 20 references indexed in Scilit:
- The Multiserver Job Queuing Model with two job classes and Cox-2 service timesPerformance Evaluation, 2025
- The RESET and MARC techniques, with application to multiserver-job analysisPerformance Evaluation, 2023
- The saturated Multiserver Job Queuing Model with two classes of jobs: Exact and approximate resultsPerformance Evaluation, 2023
- The multiserver job queueing modelQueueing Systems, 2022
- Exact sampling for some multi-dimensional queueing models with renewal inputAdvances in Applied Probability, 2019
- Stability Analysis of a Multi-server Model with Simultaneous Service and a Regenerative Input FlowMethodology and Computing in Applied Probability, 2019
- Stability criterion of a multiserver model with simultaneous serviceAnnals of Operations Research, 2015
- Anparallel system model with pure space sharing among rigid jobsMathematical and Computer Modelling, 2007
- Construction of the stationary regime of queues with lockingStochastic Processes and their Applications, 1987
- The stability of a queue with non-independent inter-arrival and service timesMathematical Proceedings of the Cambridge Philosophical Society, 1962