Controlling Variability in Split-Merge Systems
We consider split-merge systems with heterogeneous subtask service times and limited output buffer space in which to hold completed but as yet unmerged subtasks. An important practical problem in such systems is to limit utilisation of the output buffer. This can be achieved by judiciously delaying the processing of subtasks in order to cluster subtask completion times. In this paper we present a methodology to find those deterministic subtask processing delays which minimise any given percentile of the difference in times of appearance of the first and the last subtasks in the output buffer. Technically this is achieved in three main steps: firstly, we define an expression for the distribution of the range of samples drawn from n independent heterogeneous service time distributions. This is a generalisation of the well-known order statistic result for the distribution of the range of n samples taken from the same distribution. Secondly, we extend our model to incorporate deterministic delays applied to the processing of subtasks. Finally, we present an optimisation scheme to find that vector of delays which minimises a given percentile of the range of arrival times of subtasks in the output buffer. A case study illustrates the applicability of our proposed approach.
KeywordsCompletion Time Order Statistic Service Time Output Buffer Service Time Distribution
Unable to display preview. Download preview PDF.
- 2.Bolch, G., et al.: Queueing Networks and Markov Chains. John Wiley (2006)Google Scholar
- 3.Brent, R.P.: Algorithms for Minimization Without Derivatives. Dover Books on Mathematics, ch. 4. Dover Publications (2002)Google Scholar
- 4.Burden, E.F., Burden, R.L.: Numerical Methods, 3rd edn. Cram101 Textbook Outlines. Academic Internet Publishers (2006)Google Scholar
- 6.David, H.A.: Order Statistics. Wiley Series in Probability and Mathematical Statistics. John Wiley (1980)Google Scholar
- 7.David, H.A., Nagaraja, H.N.: The non-IID case. In: Order Statistics, ch. 5, 3rd edn., pp. 95–120. John Wiley & Sons, Inc. (2005)Google Scholar
- 9.Lebrecht, A., Knottenbelt, W.J.: Response Time Approximations in Fork-Join Queues. In: 23rd Annual UK Performance Engineering Workshop (UKPEW) (July 2007)Google Scholar
- 15.Serfozo, R.: Basics of Applied Stochastic Processes. Springer (2009)Google Scholar
- 16.Tsimashenka, I., Knottenbelt, W.J.: Reduction of Variability in Split–Merge Systems. In: Imperial College Computing Student Workshop (ICCSW 2011), pp. 101–107 (2011)Google Scholar
- 17.Varki, E., Merchant, A., Chen, H.: The M/M/1 fork-join queue with variable sub-tasksGoogle Scholar
- 19.Zaharia, M., et al.: Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling. In: Proc. 5th European Conference on Computer Systems (EuroSys 2010), pp. 265–278 (2010)Google Scholar