Skip to main content

Ontology-Based Approach to Scheduling of Jobs Processed by Applications Running in Virtual Environments

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 518))

Abstract

This paper presents an ontology-based approach to the problem of jobs scheduling in case where jobs are processed by applications running in virtual environments and number of applications and their performance varies over time. Using ontology-based framework brings benefits when system has a varying number of components and their performing properties are also non-constant. The work is focused on ontology model needed to organize information exchange for intelligent agents embedded into virtual machines and gathering information about applications performance. In cases when jobs of one type can be processed by several applications having different performance, the existence of optimal threshold queuing policy has been proven earlier. It can reduce the average job processing time. In order to calculate thresholds we need relevant information about active applications and their current performance, the rate of jobs stream, the number of jobs in the queues, etc. The presented approach solves the problem of effective gathering of relevant information about the system state based on intelligent agents interaction where each intelligent agent uses ontology to publish only information about changes that are relevant to decision making. This reduces the system’s overhead for monitoring of ongoing parameters.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdullah, M., Othman, M.: Cost-Based Multi-QoS job scheduling using divisible load theory in cloud computing. In: Dell’Olmo, P., Pesenti, R., Speranza, M.G. (eds.) Computers & Operations Research, vol. 34, pp. 928–935. Elsevier (2007)

    Google Scholar 

  2. Arzuaga, E., Kaeli, D.R.: Quantifying load imbalance on virtualized enterprise servers. In: Proceedings of the First Joint WOSP/SIPEW International Conference on Performance Engineering, pp. 235–242 (2010)

    Google Scholar 

  3. Saraswathia, A.T., Kalaashrib, Y.R.A., Padmavathi, S.: Dynamic resource allocation scheme in cloud computing. In: Procedia Computer Science, vol. 47, pp. 30–36. Elsevier (2015)

    Google Scholar 

  4. Funika, W., Janczykowski, M., Jopek, K., Grzegorczyk, M.: An ontology-based approach to performance monitoring of MUSCULE-bound multi-scale applications. In: Procedia Computer Science, vol. 18, pp. 1126–1135. Elsevier (2013)

    Google Scholar 

  5. Hu, W., Hicks, A., Zhang, L., Dow, E.M., Soni, V., Jiang, H., Bull, R., Matthews, J.N.: A quantitative study of virtual machine live migration. In: Proceedings of the 2013 ACM Cloud and Autonomic Computing Conference (2013)

    Google Scholar 

  6. Jina, H., Linga, X., Ibrahimb, S., Caoa, W., Wua, S., Antoniub, G.: Flubber: Two-level disk scheduling in virtualized environment. In: Future Generation Computer Systems, vol. 29, pp. 2222–2238. Elsevier (2013)

    Google Scholar 

  7. Mivule, K., Turner, C.: Applying moving average filtering for non-interactive differential privacy settings. In: Procedia Computer Science, vol. 36, pp. 409–415. Elsevier (2014)

    Google Scholar 

  8. Rykov, V., Efrosinin, D.: Numerical analysis of optimal control policies for queueing systems with heterogeneous servers (2002)

    Google Scholar 

  9. Tanga, R., Yuea, Y., Dinga, X., Qiua, Y.: Credibility-based cloud media resource allocation algorithm. Journal of Network and Computer Applications 46, 315–321 (2014)

    Google Scholar 

  10. Tangmunarunkit, H., Decker, S., Kesselman, C.: Ontology-Based resource matching in the grid – the grid meets the semantic web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 706–721. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Yoo, H., Hur, C., Kim, S., Kim, Y.: An ontology-based resource selection service on science cloud. In: Slezak, D., Kim, T., Yau, S.S., Gervasi, O., Kang, B.-H. (eds.) GDC 2009. CCIS, vol. 63, pp. 221–228. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Zhang, Z.G., Love, E., Song, Y.: The optimal service time allocation of a versatile server to queue jobs and stochastically available non-queue jobs of different typess. In: Dell’Olmo, P., Pesenti, R., Speranza, M.G. (eds.) Procedia Computer Science, vol. 18, pp. 1857–1870 (2013)

    Google Scholar 

  13. Zubok, D., Maiatin, A., Kiryushkina, V., Khegai, M.: Functional model of a software system with random time horizon. In: 2015 17TH Conference of Open Innovations Association (FRUCT), pp. 259–266 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dmitrii Zubok .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Khegai, M., Zubok, D., Maiatin, A. (2015). Ontology-Based Approach to Scheduling of Jobs Processed by Applications Running in Virtual Environments. In: Klinov, P., Mouromtsev, D. (eds) Knowledge Engineering and Semantic Web. KESW 2015. Communications in Computer and Information Science, vol 518. Springer, Cham. https://doi.org/10.1007/978-3-319-24543-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24543-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24542-3

  • Online ISBN: 978-3-319-24543-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics