Skip to main content
SpringerLink
Log in

Analysis and Evaluation of Scheduling Policies for Consolidated I/O Operations

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

Hypervisors’ smooth operation and efficient performance has an immediate effect in the supported Cloud services. We investigate scheduling algorithms that match I/O requests originated from virtual resources, to the physical CPUs that do the actual processing. We envisage a new paradigm of virtualized resource consolidation, where I/O resources required by several Virtual Machines (VMs) in different physical hosts, are provided by one (or more) external powerful dedicated appliance(s), namely the I/O Hypervisor (IOH). For this reason I/O operations are transferred from the VMs to the IOH, where they are executed. We propose and evaluate a number of scheduling algorithms for this hypervisor model, concentrating on providing guaranteed fairness among the virtual resources. A simulator has been built that describes this model and is used for the implementation and the evaluation of the algorithms. We also analyze the performance of the different hypervisor models and highlight the importance of fair scheduling.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. OpenStack, “OpenStack Open Source Cloud Computing Software,”. https://www.openstack.org/ (2016). Accessed 8 Jan 2017

  2. Orbit Project, “ORBIT – Business Continuity as a Service,”. http://www.orbitproject.eu/ (2016). Accessed 8 Jan 2017

  3. Kuperman, Y., Moscovici, E., Nider, J., Ladelsky, R., Gordon, A., Tsafrir, D.: Paravirtual remote I/O. In: Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, pp 49–65. ACM (2016)

  4. Sugerman, J., Venkitachalam, G., Lim, B.-H.: Virtualizing I/O devices on VMware Workstation’s hosted virtual machine Monitor. In: USENIX Annual Technical Conference, General Track, pp 1–14 (2001)

  5. Russell, R.: virtio: towards a de-facto standard for virtual I/O devices. ACM SIGOPS Operating Systems Review 42(5), 95–103 (2008)

    Article  Google Scholar 

  6. Fraser, K., Hand, S., Neugebauer, R., Pratt, I., Warfield, A., Williamson, M.: Safe hardware access with the Xen virtual machine monitor. In: 1st Workshop on Operating System and Architectural Support for the on demand IT InfraStructure (OASIS), pp 1–1 (2004)

  7. Yassour, B.-A., Ben-Yehuda, M., Wasserman, O.: Direct device assignment for untrusted fully-virtualized virtual machines. Tech. rep. (2008). IBM Research Report H-0263, Tech. Rep.

  8. Gordon, A., Har’El, N., Landau, A., Ben-Yehuda, M., Traeger, A.: Towards exitless and efficient paravirtual I/O. In: Proceedings of the 5th Annual International Systems and Storage Conference, p 10. ACM (2012)

  9. Dong, Y., Yu, Z., Rose, G.: SR-IOV networking in Xen: Architecture, design and implementation. In: Workshop on I/O Virtualization (2008)

  10. Ongaro, D., Cox, A. L., Rixner, S.: Scheduling I/O in virtual machine monitors. In: Proceedings of the 4th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, pp 1–10. ACM (2008)

  11. Cherkasova, L., Gupta, D., Vahdat, A.: Comparison of the three CPU schedulers in Xen. SIGMETRICS Performance Evaluation Review 35(2), 42–51 (2007)

    Article  Google Scholar 

  12. Cherkasova, L., Gupta, D., Vahdat, A.: When virtual is harder than real: Resource allocation challenges in virtual machine based it environments Hewlett. Packard Laboratories, Tech. Rep. HPL-2007-25 (2007)

  13. Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. ACM SIGCOMM Computer Communication Review 19(4), 1–12 (1989)

    Article  Google Scholar 

  14. Parekh, A. K., Gallager, R. G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking (ToN) 1(3), 344–357 (1993)

    Article  Google Scholar 

  15. Bennett, J. C., Zhang, H.: WF2Q: worst-case fair weighted fair queueing. In: INFOCOM’96. 15th Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE, vol. 1, pp 120–128. IEEE (1996)

  16. Goyal, P., Vin, H. M., Chen, H.: Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. In: ACM SIGCOMM Computer Communication Review, vol. 26, pp 157–168. ACM (1996)

  17. Duda, K. J., Cheriton, D. R.: Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In: ACM SIGOPS Operating Systems Review, vol. 33, pp 261–276. ACM (1999)

  18. Shreedhar, M., Varghese, G.: Efficient fair queuing using deficit round-robin. IEEE/ACM Trans. Networking 4(3), 375–385 (1996)

    Article  Google Scholar 

  19. Zhang, Y. J.: A multi-server scheduling framework for resource allocation in wireless multi-carrier networks. IEEE Trans. Wirel. Commun. 6(11), 3884–3891 (2007)

    Article  Google Scholar 

  20. Chandra, A., Adler, M., Goyal, P., Shenoy, P.: Surplus fair scheduling: A proportional-share CPU scheduling algorithm for symmetric multiprocessors. In: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation-Volume 4, pp 4–4. USENIX Association (2000)

  21. Mohanty, S. R., Bhuyan, L. N.: Fair scheduling over multiple servers with flow-dependent server rate. In: Proceedings 2006 31st IEEE Conference on Local Computer Networks, pp 73–80. IEEE (2006)

  22. Li, T., Baumberger, D., Hahn, S.: Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin. In: ACM Sigplan Notices, vol. 44, pp 65–74. ACM (2009)

  23. Parekh, A. K., Gallagher, R. G.: A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Transactions on Networking (TON) 2 (2), 137–150 (1994)

    Article  Google Scholar 

  24. Blanquer, J. M., Özden, B.: Fair queuing for aggregated multiple links. ACM SIGCOMM Computer Communication Review 31(4), 189–197 (2001)

    Article  Google Scholar 

  25. Verma, A., Kaushal, S.: Cost-time efficient scheduling plan for executing workflows in the cloud. Journal of Grid Computing, 1–12 (2015)

  26. Tang, Z., Qi, L., Cheng, Z., Li, K., Khan, S. U., Li, K.: An energy-efficient task scheduling algorithm in dvfs-enabled cloud environment. Journal of Grid Computing, 1–20 (2015)

  27. Li, K.: Optimal load distribution for multiple heterogeneous blade servers in a cloud computing environment. Journal of grid computing 11(1), 27–46 (2013)

    Article  Google Scholar 

  28. Caprita, B., Nieh, J., Stein, C.: Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. In: Proceedings of the 25th annual ACM symposium on Principles of distributed computing, pp 72–81. ACM (2006)

  29. Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: Fair allocation of multiple resource types. In: NSDI, vol. 11, pp 24–24 (2011)

  30. Ghodsi, A., Sekar, V., Zaharia, M., Stoica, I.: Multi-resource fair queueing for packet processing. ACM SIGCOMM Computer Communication Review 42(4), 1–12 (2012)

    Article  Google Scholar 

  31. Yap, K.-K., McKeown, N., Katti, S.: Multi-server generalized processor sharing. In: Proceedings of the 24th International Teletraffic Congress, p 29. International Teletraffic Congress (2012)

  32. Zeldes, Y., Feitelson, D. G.: On-line fair allocations based on bottlenecks and global priorities. In: Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering, pp 229–240. ACM (2013)

  33. Lai, C. A., Wang, Q., Kimball, J., Li, J., Park, J., Pu, C.: IO performance interference among consolidated n-tier applications: Sharing is better than isolation for disks. In: 2014 IEEE 7th International Conference on Cloud Computing, pp 24–31. IEEE (2014)

  34. Kim, H., Lim, H., Jeong, J., Jo, H., Lee, J.: Task-aware virtual machine scheduling for i/o performance. In: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, pp 101–110. ACM (2009)

  35. Tan, H., Li, C., He, Z., Li, K., Hwang, K.: VMCD: A virtual multi-channel disk i/o scheduling method for virtual machines (2015)

  36. Nikolova, D., Blondia, C.: Bonded deficit round robin scheduling for multi-channel networks. Comput. Netw. 55(15), 3503–3516 (2011)

    Article  Google Scholar 

  37. Yap, K.-K., Huang, T.-Y., Yiakoumis, Y., Chinchali, S., McKeown, N., Katti, S.: Scheduling packets over multiple interfaces while respecting user preferences. In: Proceedings of the ninth ACM conference on Emerging networking experiments and technologies, pp 109–120. ACM (2013)

  38. Bertsekas, D. P., Gallager, R. G., Humblet, P.: Data networks, vol. 2. Prentice-Hall International, New Jersey (1992)

  39. Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round robin. SIGCOMM Comput. Commun. Rev. 25(4), 231–242 (1995). [Online]. Available. doi:10.1145/217391.217453

    Article  Google Scholar 

  40. Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round robin. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, ser. SIGCOMM ’95. [Online]. Available. doi:10.1145/217382.217453, pp 231–242. ACM, New York, NY, USA (1995)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Informatics, University Campus, Patras, Greece

    Konstantinos Kontodimas & Panagiotis Kokkinos

  2. Computer Technology Institute & Press “Diophantus”, University Campus, Patras, Greece

    Panagiotis Kokkinos, Athanasios Houbavlis & Emmanouel Varvarigos

  3. IBM Research and Development, Haifa, Israel

    Yossi Kuperman

  4. School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece

    Emmanouel Varvarigos

Authors
  1. Konstantinos Kontodimas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panagiotis Kokkinos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yossi Kuperman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Athanasios Houbavlis
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Emmanouel Varvarigos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Konstantinos Kontodimas.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kontodimas, K., Kokkinos, P., Kuperman, Y. et al. Analysis and Evaluation of Scheduling Policies for Consolidated I/O Operations. J Grid Computing 15, 107–125 (2017). https://doi.org/10.1007/s10723-017-9392-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-017-9392-4

Keywords

Search

Navigation