Skip to main content
SpringerLink
Log in

Ring Algorithms for Scheduling in Grid Systems

  • Conference paper
Software Engineering in Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 349))

Abstract

We consider the model of task scheduling in Grid systems that can be represented by the first coordinate quadrant. The process of task scheduling is based on the parity of processor resources and time resources. We previously proposed a classification of sets of multiprocessor tasks that are to be processed by a Grid system that consists of three types: circular-type, hyperbolic and parabolic task queues. We describe the polynomial time ring algorithm, apply it to a circular-type task queue, and compare our results with the optimal packing of rectangles in an enclosing rectangle of minimum area. Our comparative analysis demonstrates the applicability of the proposed ring algorithm in task scheduling in Grid systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Magoulès, F., Nguyen, T., Yu, L.: Grid resource management: toward virtual and services compliant grid computing. Numerical analysis and scientific computing. CRC Press, UK (2009)

    Google Scholar 

  2. Magoulès, F. (ed.): Fundamentals of grid computing: theory, algorithms and technologies. Numerical analysis and scientific computing. CRC Press, UK (2010)

    Google Scholar 

  3. Antonopoulos, N., Exarchakos, G., Li, M., Liotta, A. (eds.): Handbook of research on p2p and grid systems for service-oriented computing: models, methodologies and applications. IGI Global publisher, USA (2010)

    Google Scholar 

  4. Li, M., Baker, M.: The grid: core technologies. John Wiley & Sons Ltd., England (2005)

    Book  Google Scholar 

  5. Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: Evaluation of job-scheduling strategies for grid computing. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 191–202. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Rahman, M., Ranjan, R., Buyya, R., Benatallah, B.: A taxonomy and survey on autonomic management of applications in grid computing environments. Concurrency Computat.: Pract. Exper. (23), 1990–2019 (2011)

    Google Scholar 

  7. Krauter, K., Buyya, R., Maheswaran, M.: A taxonomy and survey of Grid resource management systems for distributed computing. Softw. Pract. Exper. 32(2), 135–164 (2002)

    Article  MATH  Google Scholar 

  8. Iosup, A., Epema, D.H.J., Tannenbaum, T., Farrellee, M., Livny, M.: Inter-operating Grids through delegated matchmaking. In: 2007 ACM/IEEE Conference on Supercomputing (SC 2007), pp. 1–12. ACM Press, New York (2007)

    Google Scholar 

  9. Patel, S.: Survey Report of Job Scheduler on Grids. International Journal of Emerging Research in Management &Technology 2(4), 115–125 (2013)

    Google Scholar 

  10. Assunção, M., Buyya, R.: Architectural elements of resource sharing networks. In: Li, K., Hsu, C., Yang, L., Dongarra, J., Zima, H. (eds.) Handbook of Research on Scalable Computing Technologies, vol. 2, pp. 517–550. IGI Global publisher (2010)

    Google Scholar 

  11. Netto, M., Buyya, R.: Resource Co-allocation in Grid Computing Environments. In: Antonopoulos, N., Exarchakos, G., Li, M., Liotta, A. (eds.) Handbook of Research on p2p and Grid Systems for Service-oriented Computing: Models, Methodologies and Applications, vol. 1, pp. 476–494. IGI Global publisher (2010)

    Google Scholar 

  12. Barsky, A.B.: Parallel information technologies. INTUIT, BINOM Knowledge Lab, Moscow (2007)

    Google Scholar 

  13. Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research (141), 241–252 (2002)

    Google Scholar 

  14. Caramia, M., Giordani, S., Iovanella, A.: Grid scheduling by on-line rectangle packing. Networks 44(2), 106–119 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Schwiegelshohn, U., Badia, R., Bubak, M., Danelutto, M., Dustdar, S., Gagliardi, F., Geiger, A., Hluchy, L., Kranzlmüller, D., Laure, E., Priol, T., Reinefeld, A., Resch, M., Reuter, A., Rienhoff, O., Rüter, T., Sloot, P., Talia, D., Ullmann, K., Yahyapour, R., Voigt, G.: Perspectives on grid computing. Future Generation Computer Systems (26), 1104–1115 (2010)

    Google Scholar 

  16. Saak, A.E.: Local-optimal synthesis of schedules for Grid technologies. Journal of Information Technologies 12, 16–20 (2010)

    Google Scholar 

  17. Saak, A.E.: Dispatching algorithms in Grid systems based on an array of demands quadratic typification. Journal of Information Technologies 11, 9–13 (2011)

    Google Scholar 

  18. Maag, V., Berger, M., Winterfeld, A., Küfer, K.-H.: A novel non-linear approach to minimal area rectangular packing. Annals of Operations Research 179, 243–260 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  19. Bortfeldt, A.: A reduction approach for solving the rectangle packing area minimization problem. European Journal of Operational Research 224, 486–496 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  20. Huang, E., Korf, R.: Optimal rectangle packing: an absolute placement approach. Journal of Artificial Intelligence Research 46, 47–87 (2012)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Southern Federal University, Rostov-on-Don, Russia

    A. E. Saak, V. V. Kureichik & E. V. Kuliev

Authors
  1. A. E. Saak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. V. Kureichik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. V. Kuliev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. E. Saak .

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Roman Senkerik

  3. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zuzana Kominkova Oplatkova

  4. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Zdenka Prokopova

  5. Faculty of Applied Informatics, Tomas Bata University in Zlín, Zlín, Czech Republic

    Petr Silhavy

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Saak, A.E., Kureichik, V.V., Kuliev, E.V. (2015). Ring Algorithms for Scheduling in Grid Systems. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Software Engineering in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 349. Springer, Cham. https://doi.org/10.1007/978-3-319-18473-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18473-9_20

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18472-2

  • Online ISBN: 978-3-319-18473-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation