Controlling Variability in Split-Merge Systems

  • Iryna Tsimashenka
  • William Knottenbelt
  • Peter Harrison
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7314)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ali, M.M., Gabere, M.N.: A simulated annealing driven multi-start algorithm for bound constrained global optimization. Journal of Computational and Applied Mathematics 223(10), 2661–2674 (2010)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bolch, G., et al.: Queueing Networks and Markov Chains. John Wiley (2006)Google Scholar
  3. 3.
    Brent, R.P.: Algorithms for Minimization Without Derivatives. Dover Books on Mathematics, ch. 4. Dover Publications (2002)Google Scholar
  4. 4.
    Burden, E.F., Burden, R.L.: Numerical Methods, 3rd edn. Cram101 Textbook Outlines. Academic Internet Publishers (2006)Google Scholar
  5. 5.
    Cao, G., West, M.: Computing distributions of order statistics. Communications in Statistics – Theory and Methods 26(3), 755–764 (1997)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    David, H.A.: Order Statistics. Wiley Series in Probability and Mathematical Statistics. John Wiley (1980)Google Scholar
  7. 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
  8. 8.
    Harrison, P.G., Zertal, S.: Queueing models of RAID systems with maxima of waiting times. Perf. Evaluation 64(7-8), 664–689 (2007)CrossRefGoogle Scholar
  9. 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
  10. 10.
    Lebrecht, A.S., Dingle, N.J., Knottenbelt, W.J.: Analytical and Simulation Modelling of Zoned RAID Systems. The Computer Journal 54(5), 691–707 (2011)CrossRefGoogle Scholar
  11. 11.
    Lewis, R.M., Shepherd, A., Torczon, V.: Implementing generating set search methods for linearly constrained minimization. SIAM Journal on Scientfic Computing 29(6), 2507–2530 (2007)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Nelder, J.A., Mead, R.: A simplex method for function minimization. The Computer Journal 7(4), 308–313 (1965)MATHGoogle Scholar
  13. 13.
    Nelson, R., Tantawi, A.N.: Approximate analysis of fork/join synchronization in parallel queues. IEEE Trans. on Computers 37(6), 739–743 (1988)CrossRefGoogle Scholar
  14. 14.
    Sen, P.K.: A note on order statistics for heterogeneous distributions. The Annals of Mathematical Statistics 41(6), 2137–2139 (1970)MATHCrossRefGoogle Scholar
  15. 15.
    Serfozo, R.: Basics of Applied Stochastic Processes. Springer (2009)Google Scholar
  16. 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. 17.
    Varki, E., Merchant, A., Chen, H.: The M/M/1 fork-join queue with variable sub-tasksGoogle Scholar
  18. 18.
    Varma, S., Makowski, A.M.: Interpolation approximations for symmetric fork-join queues. Performance Evaluation 20(1-3), 245–265 (1994)CrossRefGoogle Scholar
  19. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Iryna Tsimashenka
    • 1
  • William Knottenbelt
    • 1
  • Peter Harrison
    • 1
  1. 1.Imperial College LondonLondonUnited Kingdom

Personalised recommendations