Skip to main content
SpringerLink
Log in

Rechenlastverteilung

  • Chapter
  • First Online:
Masterkurs Parallele und Verteilte Systeme

Zusammenfassung

Durch den konkurrierenden Zugriff von mehreren Anwendern auf die Ressourcen eines verteilten Systems entsteht der Bedarf, die Zuordnung dieser Ressourcen zu regeln. Die Rechenleistung der einzelnen Prozessoren des Systems ist dabei die wichtigste Ressource, die von allen Anwendungen zur Bewältigung der anfallenden Rechenlast benötigt wird. Seit den Anfängen der parallelen und verteilten Systeme ist deshalb eine Vielzahl von Methoden entstanden, um die Lastverteilung den unterschiedlichsten Bedürfnissen entsprechend durchzuführen.

Die zu verteilenden Objekte sind die Prozesse der Anwendungen. Der Begriff Task ist mitunter auch anzutreffen. Der Begriff Job findet hier im Sinne eines Arbeitsauftrags des Anwenders an das Rechnersystem Verwendung. Er ist in Tasks unterteilt, die im Allgemeinen zueinander in Beziehung stehen. Die Begriffe Task und Prozess werden synonym verwendet, wenn es sich bei den betrachteten Anwendungen um zusammengesetzte Jobs handelt.

Ein lokaler Prozess wird auf dem Rechner ausgeführt, auf dem er gestartet wurde, während alle Prozesse, die von der Lastverteilung ausgelagert werden, auch die Bezeichnung Remote-Prozesse tragen [S 96]. Unter Umständen eigenen sich nicht alle Prozesse für die Auslagerung. Reguläre Prozesse können nur lokal ausgeführt werden. Prozesse, die verteilt ausgeführt werden können, heißen auch generische Prozesse [W 99].

In der Regel wird für die Rechenressourcen der Begriff Prozessor verwendet. Synonym können hier auch die Begriffe Rechner oder Knoten vorkommen.

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.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

Literatur

  1. Alonso, R., Cova, L.L.: Sharing Jobs among Independently Owned Processors. Proceedings of the 8th International Conference on Distributed Computing Systems, IEEE, New York, 282–288, 1988.

    Google Scholar 

  2. Andrews, T., Curbera, F., Dholakia, H., Goland, Y., Klein, J., Leymann, F., Liu, K., Roller, D., Smith, D., Thatte, S., Trickovic, I., Weerawarana, S.: Business Process Execution Language for Web Services, Version 1.1. Specification, BEA Systems, IBM Corp., Microsoft Corp., SAP AG, Siebel Systems, 2003.

    Google Scholar 

  3. Alt, M., Hoheisel, A., Pohl, H.-W., Gorlatch, S.: A Grid Workflow Language Using High-Level Petri Nets. R. Wyrzykowski et al. (Eds.), PPAM 2005, LNCS 3911, pp. 715–722, Springer, Berlin, Heidelberg, 2006.

    Google Scholar 

  4. Buyya, R.: Economic-based Distributed Resource Management and Scheduling for Grid Computing. Dissertation, Monash University, Melbourne, Australia, 12. April 2002.

    Google Scholar 

  5. Brucker P.: Scheduling Algorithms. Fifth Edition. Springer Verlag 2007.

    MATH  Google Scholar 

  6. Brucker P., Knust S.: Complex Scheduling. Springer Verlag 2006.

    MATH  Google Scholar 

  7. Bonomi, F., Kumar, A.: Adaptive Optimal Load Balancing in a Heterogeneous Multiserver System with a Central Job Scheduler. Proceedings 8th Int. Conf. on Distributed Computing Systems, San Jose, CA, 1988, Computer Society Press, Washington, D.C., 500–508.

    Google Scholar 

  8. Berman, F., Wolski, R., Casanova, H., Cirne, W., Dail, H., Faerman, M., Figueira, S., Hayes, J., Obertelli, G., Schopf, J., Shao, G., Smallen, S. Spring, S., Su, A., Zagorodnov, D.: Adaptive computing on the Grid using AppLeS. IEEE Trans. on Parallel and Distributed Systems (TPDS), 14(4):369–382, 2003.

    Article  Google Scholar 

  9. Condor – High Throughput Computing, http://www.cs.wisc.edu/condor/, 2007.

  10. Czajkowski, K., Foster, I.T. Kesselman, C.; Resource Co-Allocation in Computational Grids. Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing, S. 37, 1999.

    Google Scholar 

  11. Casavant, T.L., Kuhl, J.G.: Effects of Response and Stability on Scheduling in Distributed Computing Systems. IEEE Trans. Softw. Eng., Vol. 14, No. 2, 141–154, 1988.

    Article  Google Scholar 

  12. Corradi A., Leonardi L., Zambonelli F.: Diffuse Load-Balancing Policies for Dynamic Applications. IEEE Concurrency, Vol. 7, No 1, Jan.-March 1999.

    Google Scholar 

  13. Cluster Resources Inc.: Maui Cluster Scheduler®. http://www.clusterresources.com/pages/products/maui-cluster-scheduler.php, 2007.

    Google Scholar 

  14. Cluster Resources Inc.: Moab Grid Suite®. http://www.clusterresources.com/pages/products/moab-grid-suite.php, 2007.

    Google Scholar 

  15. Dong, F., Akl, S.G.: Scheduling Algorithms for Grid Computing: State of the Art and Open Problems. Technical Report 2006-504, School of Computing, Queen’s University, Kingston, Ontario, January 2006.

    Google Scholar 

  16. Dörnemann, T., Friese, T., Herdt, S., Juhnke, E., Freisleben, B.: Grid Workflow Modelling Using Grid-Specific BPEL Extensions. German e-Science 2007, Baden-Baden; http://www.ges2007.de

    Google Scholar 

  17. Dekeyser, J.L., Fonlupt, C., Marquet, P.: Analysis of Synchronuous Dynamic Load Balancing Algorithms. ParCo ’95, Gent, Belgium, Advances in Parallel Computing, Vol. 11, 455–462, 1995.

    Google Scholar 

  18. Ferguson, D.F., Nikolaou, C., Sairamesh, J., Yemini, Y.: Economic Models for Allocating Resources in Computer Systems. In: Scott Clearwater, (ed.), Market-Based Control: A Paradigm for Distributed Resource Allocation, Scott Clearwater. World Scientific, Hong Kong, 1996.

    Google Scholar 

  19. Fonlupt, C., Marquet, P., Dekeyser, J.: „Data-Parallel Load Balancing Strategies“; Parallel Computing, 24, 1665–1684, 1998.

    Article  Google Scholar 

  20. Fuggetta, A., Picco, G.P., Vigna, G.: Understanding Code Mobility. IEEE Trans. Softw. Eng., 24, 5, 342–361, May 1998.

    Article  Google Scholar 

  21. Fahringer, T., Qin, J., Hainzer, S.: Specification of Grid Workflow Applications with AGWL: An Abstract Grid Workflow Language. In Proceedings of IEEE International Symposium on Cluster Computing and the Grid 2005 (CCGrid 2005), Cardiff, UK, May 9–12 2005, IEEE Computer Society Press.

    Google Scholar 

  22. Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and Practice in Parallel Job Scheduling. IPPS ’97 Workshop on Job Scheduling Strategies for Parallel Processing, Geneva, April 1997.

    Book  Google Scholar 

  23. Franke, C., Schwiegelshohn, U., Yahyapour, R.: Job Scheduling for Computational Grids. Forschungsbericht, Dortmund University, Department of Electrical Engineering and Information Technology, 2006.

    Google Scholar 

  24. Goscinski A.: Distributed Operating Systems – The Logical Design. Addison Wesley 1991.

    Google Scholar 

  25. Greenwood, G.W., Gupta, A., McSweeney, K.: Scheduling Tasks in Multiprocessor Systems Using Evolutionary Strategies. International Conference on Evolutionary Computation, pp. 345–349, 1994

    Google Scholar 

  26. Greenblatt B., Linn G.J.: Branch and Bound Style Algorithms for Scheduling Communicating Tasks in a Distributed System. Proc. Of the IEEE Spring CompCon. Conf, 1987.

    Google Scholar 

  27. The Globus® Alliance, http://www.globus.org/toolkit/mds/, 2007.

  28. Holland J. J.; Adaption in Natural and Artifical Systems, Univ. of Michigan Press 1975.

    Google Scholar 

  29. Hoheisel, A., Der, U.: An XML-based Framework for Loosely Coupled Applications on Grid Environments; P.M.A. Sloot et al. (Eds.): ICCS 2003, 245–254, Springer-Verlag Berlin Heidelberg, 2003.

    Chapter  Google Scholar 

  30. Hovestadt, M, Keller, O.A., Streit, A.: Scheduling in HPC Resource Management Systems: Queuing vs. Planning. Proceedings of the 9th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP) at GGF8, Seattle, WA, USA, June 24, 2003, LNCS 2862, 1–20.

    Google Scholar 

  31. Hamidzadeh, B., Laija, D.J., Atif, Y.: Dynamic Scheduling Techniques for hetereogeneous Computing Systems. Concurrency: practice and Experience, Vol. 7, 633–652, 1995.

    Article  Google Scholar 

  32. IBM: Web Services Flow Language (WSFL 1.0). http://xml.coverpages.org/WSFL-Guide-200110.pdf, May 2001.

    Google Scholar 

  33. Jansen K.: The mutual exclusion scheduling problem for Permutation and comparability graphs. Information and Computation 180, 2 January 2003.

    Google Scholar 

  34. Jakob, W: Towards an Adaptive Multimeme Algorithm for Parameter Optimisation Suiting the Engineers’ Needs. In: Runarsson, T.P., et al. (eds.): Conf. Proc. PPSN IX, LNCS 4193, Springer, Berlin (2006) 132–141.

    Google Scholar 

  35. Kwok Y.-K., Ahmad I.: Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. Journal of Parallel and Distributed Computing Vol. 47, Number 1, 1997.

    Google Scholar 

  36. Kwok, Y.-K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, 31 (4), 406–471, December 1999.

    Article  Google Scholar 

  37. Ludwig, T.: Lastverwaltungsverfahren für Mehrprozessorsysteme mit verteiltem Speicher. Dissertation, Technische Universität München, 1992.

    Google Scholar 

  38. von Laszewski, G., Alunkal, B., Amin, K., Hampton, S,, Nijsure, S.: GridAnt – Client Side Grid Workflow Management with Ant. http://www-unix.globus.org/cog/projects/gridant/, 2002

    Google Scholar 

  39. Lee K.G.: Efficient parallelization of simulated annealing using multiple Markov chains: an application to graph partition. Proc. of the 1992 Int’l Conf. on Parallel Processing 1992.

    Google Scholar 

  40. Lee B., Hurson A.R., Feng T.-Y.: A Vertically Layered Allocation Scheme for Data Flow Systems. Journal of Parallel and Distributed System Vol. 11, No. 3, 1991.

    Google Scholar 

  41. Li, J., Kameda, H.: „Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems“; IEEE Transaction on Computers, Vol. 47, No. 3, pp 322–332, 1998.

    Article  MathSciNet  Google Scholar 

  42. S. Kannan et al., IBM: http://www.redbooks.ibm.com/redbooks/pdfs/sg246038.pdf, 2001.

    Google Scholar 

  43. Lüling R. and B. Monien B.: Load Balancing for Distributed Branch & Bound Algorithms. Intern. Par. Processing Symp., IPPS 1992.

    Book  Google Scholar 

  44. Platform Computing Inc.: http://www.platform.com/Products/Platform.LSF.Family/Platform.LSF/Home.htm, 2007.

  45. Lee, K.J., Towsley, D.: A Comparison of Priority-Based Decentralized Load Balancing Policies. Proceedings of the 10th Symposium on Operating System Principle, Association for Computing Machinery, New York, 70–77, 1986.

    Google Scholar 

  46. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, 2nd edition, 1994.

    Book  MATH  Google Scholar 

  47. Microsoft: XLANG – Web Services for Business Process Design. http://xml.coverpages.org/XLANG-C-200106.html, 2001.

    Google Scholar 

  48. Nabrzyski, J., Schopf, J.M., Weglarz, J. (Hrsg.): Grid Resource Management – State of the Art and Future Trends. Kluwer Academic Publishers, 2004.

    MATH  Google Scholar 

  49. Osman, A., Ammar, H.: Dynamic Load Balancing Strategies for Parallel Computers, International Symposium on Parallel and Distributed Computing (ISPDC), Romania, July 2002.

    Google Scholar 

  50. Altair Engineering, Inc.: PBS® GridWorks®. http://www.pbsgridworks.com, 2007.

    Google Scholar 

  51. Rechenberg, I.: Evolutionsstrategie ’94. Frommann-Holzboog Verlag, Stuttgart, 1994.

    Google Scholar 

  52. Starke, P.H.: Analyse von Petri-Netz-Modellen. B.G. Teubner, Stuttgart, 1990.

    Book  MATH  Google Scholar 

  53. Sinha P. K.: Distributed Operating Systems, Concepts and Design. IEEE Press 1996.

    Book  Google Scholar 

  54. Stucky, K.-U., Jakob, J., Quinte, A., Süß, W.: Solving Scheduling Problems in Grid Resource Management Using an Evolutionary Algorithm. R. Meersman, Z. Tari et al. (Eds.): OTM 2006, LNCS 4276, pp. 1252–1262, Springer-Verlag Berlin Heidelberg, 2006

    Google Scholar 

  55. Hivaratri, N.G., Krueger, P.: Two Adaptive Location Policies for Global Scheduling. Proc. of the 10th International Conference on distributed Computing Systems, 1990, 502–509.

    Google Scholar 

  56. Singhal, M., Shivaratri, N.G.: Advanced Concepts in Operating Systems. McGraw-Hill, Inc., 1994.

    Google Scholar 

  57. Shen, C.C., Tsai, W.H.: A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems with Minimax Criterion. IEEE Transactions on Computers, C-94, 197–203, 1985.

    Article  Google Scholar 

  58. Tanenbaum A.: Distributed Operating Systems. Prentice-Hall 1995.

    Google Scholar 

  59. Theimer, M.M., Lantz, K.A.: Finding Idle Machines in a Workstation-Based Distributed System. IEEE Transactions on Software Engineering, Vol 15, 1444–1458, 1989.

    Article  Google Scholar 

  60. Tanenbaum, A.S., van Steen, M.: Distributed Systems – Principles and Paradigms. Pearson – Prentice Hall, 2006.

    Google Scholar 

  61. Thain, D., Tannenbaum, T., Livny, M.: Distributed computing in practice: The condor experience. Concurrency and Computation: Practice and Experience, 2004.

    Google Scholar 

  62. Wieczorek, M., Prodan, R., Hoheisel, A.: Taxonomies of the Multi-criteria GridWorkflow Scheduling Problem. CoreGRID Technical Report Number TR-0106, August 21, 2007, Institute on Resource Management and Scheduling, CoreGRID – Network of Excellence, URL: http://www.coregrid.net, 2007

    Google Scholar 

  63. Wu, J.: Dimension-Exchange-Based Global Load Balancing in Faulty Hypercubes. Parallel Processing Practice and Experience, 9, 1, 41–61, 1997.

    Google Scholar 

  64. Weber M.: Verteilte Systeme. Spektrum Akademischer Verlag GmbH Heidelberg, 1998.

    MATH  Google Scholar 

  65. Wu J.: Distributed System Design. CRC Press 1999.

    MATH  Google Scholar 

  66. Wolski, R, Spring, N., Hayes, J.: The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Future Generation Computer Systems, 15, 5–6, 757–768, 1999.

    Article  Google Scholar 

  67. Zaki, M.J., Li, W., Parthasarathy, S.; Customized Dynamic Load Balancing for a Network of Workstations. Proceedings of the 5th IEEE Int. Symp., HPDC, 1996, 282–291.7.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Fachhochschule Frankfurt am Main, Frankfurt, Deutschland

    Christian Baun

  2. Fakultät für Informatik, Hochschule Mannheim, Mannheim, Deutschland

    Günther Bengel

  3. Steinbuch Centre for Computing (SCC), Karlsruhe Institut für Technologie (KIT), Eggenstein-Leopoldshafen, Deutschland

    Marcel Kunze

  4. Institut für Angewandte Informatik (IAI), Karlsruher Institut für Technologie (KIT), Eggenstein-Leopoldshafen, Deutschland

    Karl-Uwe Stucky

Authors
  1. Christian Baun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günther Bengel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcel Kunze
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Karl-Uwe Stucky
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Baun, C., Bengel, G., Kunze, M., Stucky, KU. (2015). Rechenlastverteilung. In: Masterkurs Parallele und Verteilte Systeme. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-8348-2151-5_8

Download citation

Publish with us

Policies and ethics

Search

Navigation