Advertisement

A Queueing Theory Approach to Pareto Optimal Bags-of-Tasks Scheduling on Clouds

Conference paper
  • 2.4k Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8632)

Abstract

Cloud hosting services offer computing resources which can scale along with the needs of users. When access to data is limited by the network capacity this scalability also becomes limited. To investigate the impact of this limitation we focus on bags–of–tasks where task data is stored outside the cloud and has to be transferred across the network before task execution can commence. The existing bags–of–tasks estimation tools are not able to provide accurate estimates in such a case. We introduce a queuing–network inspired model which successfully models the limited network resources. Based on the Mean–Value Analysis of this model we derive an efficient procedure that results in an estimate of the makespan and the executions costs for a given configuration of cloud virtual machines. We compare the calculated Pareto set with measurements performed in a number of experiments for real–world bags–of–tasks and validate the proposed model and the accuracy of the estimated configurations.

References

  1. 1.
    Amazon ec2 - amazon elastic compute cloud, https://aws.amazon.com/ec2/ (accessed: January 27, 2014)
  2. 2.
    Imagemagick: Convert, edit, or compose bitmap images, http://www.imagemagick.org/ (accessed: Januray 27, 2014)
  3. 3.
    Openjpeg - jpeg2000 codec, http://www.openjpeg.org/ (accessed: January 27, 2014)
  4. 4.
    Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22(2), 248–260 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Bolch, G., Greiner, S., de Meer, H., Trivedi, K.S.: Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications. Wiley-Interscience, New York (1998)CrossRefzbMATHGoogle Scholar
  6. 6.
    Cirne, W., Paranhos, D., Costa, L., Santos-Neto, E., Brasileiro, F., Sauve, J., Silva, F.A.B., Barros, C., Silveira, C.: Running bag-of-tasks applications on computational grids: The mygrid approach. In: Proceedings of the 2003 International Conference on Parallel Processing, 2003, pp. 407–416 (2003)Google Scholar
  7. 7.
    Frey, J., Tannenbaum, T., Livny, M., Foster, I., Tuecke, S.: Condor-g: A computation management agent for multi-institutional grids. Cluster Computing 5(3), 237–246 (2002)CrossRefGoogle Scholar
  8. 8.
    Lavenberg, S.S.: Computer Performance Modeling Handbook. Academic Press, Inc., Orlando (1983)Google Scholar
  9. 9.
    Little, J.D.C.: A proof for the queuing formula: L = λ w. Operations Research 9(3), 383–387 (1961)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Mao, M., Humphrey, M.: Auto-scaling to minimize cost and meet application deadlines in cloud workflows. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2011, p. 49:1–49:12. ACM, New York (2011)Google Scholar
  11. 11.
    McClatchey, R., Anjum, A., Stockinger, H., Ali, A., Willers, I., Thomas, M.: Data intensive and network aware (diana) grid scheduling. Journal of Grid Computing 5(1), 43–64 (2007)CrossRefGoogle Scholar
  12. 12.
    Oprescu, A.-M., Kielmann, T., Leahu, H.: Budget estimation and control for bag-of-tasks scheduling in clouds. Parallel Processing Letters 21(02), 219–243 (2011)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Reiser, M., Lavenberg, S.S.: Mean-value analysis of closed multichain queuing networks. J. ACM 27(2), 313–322 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Taheri, J., Zomaya, A.Y., Siegel, H.J., Tari, Z.: Pareto frontier for job execution and data transfer time in hybrid clouds. Future Generation Computer Systems (2013)Google Scholar
  15. 15.
    Takefusa, A., Tatebe, O., Matsuoka, S., Morita, Y.: Performance analysis of scheduling and replication algorithms on grid datafarm architecture for high-energy physics applications. In: HPDC, vol. 3, p. 34 (2003)Google Scholar
  16. 16.
    Vintila, A., Oprescu, A.-M., Kielmann, T.: Fast (re-)configuration of mixed on-demand and spot instance pools for high-throughput computing. In: Proceedings of the First ACM Workshop on Optimization Techniques for Resources Management in Clouds, ORMaCloud 2013, pp. 25–32. ACM, New York (2013)CrossRefGoogle Scholar
  17. 17.
    White, T.: Hadoop: The Definitive Guide, 1st edn. O’Reilly Media, Inc. (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.System and Network Engineering GroupUniversity of Amsterdam (UvA)AmsterdamThe Netherlands
  2. 2.Department of StochasticsCentre for Mathematics and Informatics (CWI)AmsterdamThe Netherlands

Personalised recommendations