On the Throughput Optimization in Large-Scale Batch-Processing Systems
- 5 March 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 48 (3), 128-129
- https://doi.org/10.1145/3453953.3453982
Abstract
We analyze a data-processing system with n clients producing jobs which are processed in batches by m parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup function that arises due to overhead amortization. In practice, throughput optimization relies on numerical searches for the optimal batch size which is computationally cumbersome. In this paper, we model this system in terms of a closed queueing network assuming certain forms of service speedup; a standard Markovian analysis yields the optimal throughput in w n4 time. Our main contribution is a mean-field model that has a unique, globally attractive stationary point, derivable in closed form. This point characterizes the asymptotic throughput as a function of the batch size that can be calculated in O(1) time. Numerical settings from a large commercial system reveal that this asymptotic optimum is accurate in practical finite regimes.Keywords
This publication has 6 references indexed in Scilit:
- OLTPshareProceedings of the VLDB Endowment, 2018
- CalvinPublished by Association for Computing Machinery (ACM) ,2012
- Product form in networks of queues with batch arrivals and batch servicesQueueing Systems, 1990
- Multiple-query optimizationACM Transactions on Database Systems, 1988
- A Characterization of Product-Form Queuing NetworksJournal of the ACM, 1983
- Solutions of ordinary differential equations as limits of pure jump markov processesJournal of Applied Probability, 1970