Skip to main content
SpringerLink
Log in

Surveys and Classifications

  • Chapter
Dynamic Load Distribution for Parallel Applications

Part of the book series: TEUBNER-TEXTE zur Informatik ((TTZI,volume 24))

  • 39 Accesses

Abstract

Classification schemes are helpful tools in making the tasks of comparison and evaluation easier. Several such schemes for the purpose of classifying load distribution have been designed but so far none of them has been generally accepted. Furthermore, these schemes differ much in the extent to which technical details (like migration mechanisms etc.) have been included. This book, on the contrary, does not use one single classification scheme to cover all aspects of load distribution. Instead, several clear-cut and well-defined classification schemes for different, orthogonal aspects are presented.

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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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. P. Amaral, C. Jacquemot, P. Jensen, R. Lea and A. Mirowski. Transparent Object Migration in COOL2. In Proc. of Workshop on Dynamic Object Placement and Load-Balancing in Parallel and Distributed Systems, ECOOP ’92, Utrecht, The Netherlands, 1992.

    Google Scholar 

  2. G. R. Andrews. Paradigms for Process Interaction in Distributed Programs. ACM Computing Surveys, 23(1):49–90, March 1991.

    Article  Google Scholar 

  3. C. Burdorf and J. Marti. Load Balancing Strategies for Time Warp on Multi-User Workstations. The Computer Journal, 36(2):168–176, 1993.

    Article  Google Scholar 

  4. N. Carriero, D. Gelernter, T. Mattson and A. Sherman. The Linda alternative to message-passing systems. Parallel Computing, 20(4):656, 1994.

    Article  Google Scholar 

  5. J. Casas, R. Konuru and S. W. Otto. Adaptive Load Migration systems for PVM. In Supercomputing ’94, Washington D.C., pages 390–399, 1994.

    Google Scholar 

  6. Genias Software GmbH. Codine COmputing in DIstributed Networked Environments, 1993.

    Google Scholar 

  7. A. S. Grimshaw. Easy-to-use Object-Oriented Parallel Processing with Mentat. Computer, 26(5):39–51, 1993.

    Article  MathSciNet  Google Scholar 

  8. M. Hamdi and C.-K. Lee. Dynamic Load Balancing of Data Parallel Applications on a Distributed Network. In International Conference on Supercomputing, Barcelona, Spain, 1995.

    Google Scholar 

  9. R. V. Hanxleden and L. R. Scott. Load Balancing on Message Passing Architectures. Journal of Parallel and Distributed Computing, 13:312–324, 1991.

    Article  Google Scholar 

  10. K. A. Hua and H. C. Young. A Cell—Based Data Partitioning Strategy for Efficient Load Balancing in A Distributed Memory Multicomputer Database System. Technical Report RJ 8041, IBM Research Report, 1991.

    Google Scholar 

  11. J. A. Kaplan and M. L. Nelson. A Comparison of Queueing, Cluster and Distributed Computing Systems. Technical Report Technical Memorandum 109025 (Revision 1), NASA Langley Research Center, Hampton, Virginia, 1994.

    Google Scholar 

  12. R. Konuru, J. Casas, S. Otto, R. Prouty and J. Walpole. A user-lvel process package for PVM. In Scalable High-Performance Computing Conference, pages 48–55. IEEE Computer Society Press, 1994.

    Chapter  Google Scholar 

  13. S. Miguet and Y. Robert. Elastic load—balancing for image processing algorithms. In First International Conference of the Austrian Center for Parallel Computation, Salzburg, September 1991.

    Google Scholar 

  14. E. Rahm and R. Marek. Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. In Proceedings of the 19th International Conference on Very Large Data Bases, Dublin, Ireland, 1993.

    Google Scholar 

  15. L. Revor. DQS users guide, 1992.

    Google Scholar 

  16. T. Schnekenburger and M. Huber. Heterogeneous Partitioning in a Workstation Network. In 8th Int. Parallel Processing Symposium, Workshop on Heterogeneous Computing, Cancun, Mexico, pages 72–77. IEEE, 1994.

    Google Scholar 

  17. T. Schnekenburger. Integration of Load Distribution into ParMod-C. Technical Report TUM19536 and SFB 342/19/95 A, Technische Universität München, 1995. http://www.paulinformatik.tumuenchen/projekte/sfb342/pub/sfb342–19-95A.ps.gz.

    Google Scholar 

  18. T. Schnekenburger. Efficiency of Dynamic Task Assignment in Multi-User Environments. In 11th Int. Conference on Systems Engineering, Las Vegas, pages 408–413. University of Nevada, July 1996.

    Google Scholar 

  19. V. Sunderam, G. Geist, J. Dongarra and R. Manchek. The PVM concurrent computing system: Evolution, experiences, and trends. Parallel Computing, 20(4):531–546, 1994.

    Article  MATH  Google Scholar 

  20. E. Tärnvik. Dynamo — A Portable Tool for Dynamic Load Balancing on Distributed Memory Multicomputers. Concurrency: Practice and Experience, 6(8):613–639, 1994.

    Article  Google Scholar 

  21. G. Weikum, P. Zabback and P. Scheuermann. Dynamic File Allocation in Disk Arrays. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, pages 406–415, Denver, Colorado, 1991.

    Chapter  Google Scholar 

  22. S. Zhou. LSF: load sharing in large-scale heterogeneous distributed systems. In Workshop on Cluster Computing, Tallahassee, Florida, December 1992.

    Google Scholar 

  23. M. Adler, S. Chakrabarti, M. Mitzenbacher and L. Rasmussen. Parallel Randomized Load Balancing. In 27th Annual ACM Symp. on Theory of Computing STOC ’95 (Las Vegas, Nevada, USA, May 29 — June 1, 1995), pages 238–248, New York, 1995. ACM SIGACT, ACM Press.

    Google Scholar 

  24. G. S. Almasi and A. Gottlieb. Highly Parallel Computing, volume 2. The Benjamin/Cummings Pubishing Company, Inc., Redwood City, CA, 1994.

    Google Scholar 

  25. B. Awerbuch, Y. Azar, E. F. Grove, M.-Y. Kao, P. Krishnan and J. S. Vitter. Load Balancing in the L p Norm. In 36th Annual Symp. on Foundations of Computer Science (Milwaukee, Wisconsin, October 23–25, 1995), pages 383–391, Los Alamitos-Washington-Brussels-Tokyo, 1995. IEEE Computer Society, IEEE Computer Society Press.

    Google Scholar 

  26. Y. Azar, A. Broder, A. Karlin and E. Upfal. Balanced Allocations. In 26th Annual ACM Symp. on Theory of Computing STOC ’94 (Montreal, Quebec, Canada), pages 593–602, New York, 1994. ACM SIGACT, ACM Press.

    Google Scholar 

  27. M. Böhm and E. Speckenmeyer. Precomputation Based Load Balancing. In 4th Workshop on Parallel Systems and Algorithms PASA ’96 (Jülich, Germany, April 10–12, 1996), pages 173–190, Singapore, 1996. World Scientific Publishing Co.

    Google Scholar 

  28. M. Böhm. Verteilte Lösung harter Probleme: Schneller Lastausgleich. Ph.d. thesis, MathematischNaturwissenschaftliche Fakultät, Universität zu Köln, 1996.

    Google Scholar 

  29. G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput., 7:279–301, 1989.

    Article  Google Scholar 

  30. T. Decker, R. Diekmann, R. Lüling and B. Monien. Towards Developing Universal Dynamic Mapping Algorithms. In 7th IEEE Symp. on Parallel and Distributed Processing 1995 (San Antonio, Texas, October 1995), pages 456–459, Los Alamitos-Washington-Brussels-Tokyo, 1995. IEEE Computer Society, IEEE Computer Society Press.

    Google Scholar 

  31. M. R. Garey and D. S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Company, New York-San Francisco, 1979.

    MATH  Google Scholar 

  32. B. Ghosh, F. Leighton, B. Maggs, S. Muthukrishnan, C. Plaxton, R. Rajaraman, A. Richa, R. Tarjan and D. Zuckerman. Tight Analyses of T\vo Local Load Balancing Algorithms. In 27th Annual ACM Symp. on Theory of Computing STOC ’95 (Las Vegas, Nevada, USA, May 29 — June 1, 1995), pages 548–558, New York, 1995. ACM SIGACT, ACM Press.

    Google Scholar 

  33. B. Ghosh and S. Muthukrishnan. Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings. In 6th Annual ACM Symp. on Parallel Algorithms and Architectures, SPAA ’94 (Cape May, New Jersey, June 27 — 29, 1994), pages 226–235, New York, 1994. ACM SIGACT, ACM SIGARCH, ACM Press.

    Chapter  Google Scholar 

  34. F. T. Leighton. Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes. Morgan Kaufmann Publishers Inc., San Mateo, CA, 1992.

    MATH  Google Scholar 

  35. F. C. Lin and R. M. Keller. The Gradient Model Load Balancing Model. IEEE Trans. Softw. Eng., SE13(1):32–38, January 1987.

    Article  Google Scholar 

  36. L. M. Ni, C.-W. Xu and T. B. Gendreau. A Distributed Drafting Algorithm for Load Balancing. IEEE Trans. Softw. Eng., SE-11(10):1153–1161, 1985.

    Article  Google Scholar 

  37. R. Radermacher. Eine Ausführungsumgebung mit integrierter Lastverteilung für verteilte und parallele Systeme. Ph.d. thesis, Fakultät für Informatik der Technischen Universität München, 1996.

    Google Scholar 

  38. J. Song. A partially asynchronous and iterative algorithm for distributed load balancing. Parallel Computing, 20:853–868, 1994.

    Article  MathSciNet  Google Scholar 

  39. J. A. Stankovic and I. S. Sidhu. An Adaptive Bidding Algorithm For Processes, Clusters and Distributed Groups. In 4th Int. Conf. on Distributed Computing Systems, pages 49–59. IEEE Computer Society Press, 1984.

    Google Scholar 

  40. The ATM Forum. ATM User-Network Interface (UNI) Specification Version 3.1. Prentice Hall PTR, Upper Saddle River, NJ, 1995.

    Google Scholar 

  41. M. H. Willebeek-Lemair and A. P. Reeves. Strategies for Dynamic Load Balancing on Highly Parallel Computers. IEEE Trans. on Parallel and Distributed Systems, 4(9):979–993, 1993.

    Article  Google Scholar 

  42. C.-Z. Xu and F. C. Lau. Iterative Dynamic Load Balancing in Multicomputers. J. Opl. Res. Soc., 45(7):786–796, 1994.

    MATH  Google Scholar 

  43. C.-Z. Xu and F. C. Lau. Optimal Parameters for Load Balancing with the Diffusion Method in Mesh Networks. Parallel Processing Letters, 4(1–2):139–148, 1994.

    Article  Google Scholar 

  44. V. Almeida, J. Arabe, E. Loures and G. Rimolo. Scheduling Parallel Jobs on a Cluster of Heterogeneous Workstations. In High Performance Computing Conference ’94, pages 103–108, Sep 1994.

    Google Scholar 

  45. W. Becker. Dynamic Balancing Complex Workload in Workstation Networks — Challange, Concepts and Experience. In B. Hertzberger and G. Serazzi, editors, HPCN — Europe, volume LNCS 919, pages 407–412, May 3–5 1995.

    Google Scholar 

  46. L. Cabrera. The Influence of Workload on Load Balancing Strategies. In 1986 Summer USENIX Conference, pages 446–458, June 1986.

    Google Scholar 

  47. J. Casas, R. Konuru, S. Otto, R. Prouty and J. Walpole. Adaptive Load Migration Systems for PVM. In Proc. Supercomputing ’94, pages 390–399, Nov. 14–18 1994.

    Google Scholar 

  48. T. L. Casavant and J. G. Kuhl. A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems. In IEEE Trans. Softw. Eng., pages 141–154, Feb 1988.

    Google Scholar 

  49. M. V. Devarakonda and R. K. Iyer. Predictability of Process Resource Usage: A Measurement Study on UNIX. In IEEE Trans. Softw. Eng., volume 15(12), pages 1579–1586, dec 1989.

    Google Scholar 

  50. D. L. Eager, E. D. Lazowska and J. Zahorjan. Adaptive Load Sharing in Homogeneous Distributed Systems. In IEEE Trans. Softw. Eng., volume SE-12, pages 662–675, May 1986.

    Google Scholar 

  51. J. D. Evans and R. R. Kessler. Allocation of Parallel Programs With Time Variant Resource Requirements. In 1993 Int. Conf. on Parallel Processing, Vol. III, pages 271–275. CRC Press, Inc., 1993.

    Chapter  Google Scholar 

  52. D. Ferrari and S. Zhou. An Empirical Investigation of Load Indices for Load Balancing Applications. In Performance ’87, 12th Int. Symp. on Computer Performance Modeling, Measurement and Evaluation, pages 515–528, 1987.

    Google Scholar 

  53. A. Hać and T. J. Johnson. Sensitivity Study of the Load Balancing Algorithm in a Distributed System. Journal of Parallel and Distributed Computing, 10:85–89, 1990.

    Article  Google Scholar 

  54. M. Hamdi and C. Lee. Dynamic Load Balancing of Data Parallel Applications in a Distributed Network. In ACM Int. Conf on Supercomputer, pages 170–179, 1995.

    Google Scholar 

  55. T. Kunz. The Influence of Different Workload Descriptions on a Heuristic Load Balancing Sheme. In IEEE Trans. Softw. Eng., volume 17(7), pages 725–730, July 1991.

    Article  Google Scholar 

  56. W. Leland and T. Ott. Load Balancing Heuristics and Process Behaviour. In ACM SIGMETRICS Conf. on Measurement and Modelling of CS, pages 54–69, May 1986.

    Google Scholar 

  57. T. Ludwig. Automatische Lastverwaltung für Parallelrechner. Reihe Informatik, Band 94. BI-Wissenschaftsverlag, 1993.

    Google Scholar 

  58. S. Majumdar and Y. M. Leung. Characterization of Applications with I/O for Processor Scheduling in Multiprogrammed Parallel Systems. In 6th IEEE Symp. on Parallel and Distributed Processing, pages 298–307, Oct. 26–29 1994.

    Google Scholar 

  59. E. Markatos and T. J. Leblanc. Using Processor Affinity in Loop Scheduling on Shared Memory Multiprocessors. In IEEE Trans. on Parallel and Distributed Systems, volume 5(4), April 1994.

    Google Scholar 

  60. P. Mehra and B. Wah. Automated Learning of Workload Measures for Load Balancing on a Distributed System. In 1993 Int. Conf. on Parallel Processing, Vol. III, pages 263–270. CRC Press, Inc., 1993.

    Chapter  Google Scholar 

  61. T. Schnekenburger. Adaptive Lastverteilung für parallele Programme. Dissertation, Techn. Univ. München, 1994.

    Google Scholar 

  62. S. Subramaniam and D. L. Eager. Affinity Scheduling of Unbalanced Workloads. In Proc. Supercomputing ’94, pages 214–226, Nov. 14–18 1994.

    Google Scholar 

  63. S. Turner, L. Ni and B. C. Cheng. lime and/or Space Sharing in a Workstation Cluster Environment. In Proc. Supercomputing ’94, pages 630–639, Nov. 14–18 1994.

    Google Scholar 

  64. A. Weinrib and S. Shenker. Greed is not enough: Adaptive Load Sharing in Large Heterogeneous systems. In Proc. of the IEEE INFOCOM, 1988.

    Google Scholar 

  65. Y. Zhang, K. Hakozaki, H. Kameda and K. Shimizu. A Performance Comparision of Adaptive and Static Load Balancing in Heterogenous Distributed Systems. In Proc. 28th Simulation Symposium, pages 332–340. IEEE Comp. Soc. Press, 1995.

    Google Scholar 

  66. Y. Artsy and R. Finkel. Designing a Process Migration Facility —The Charlotte Experience. IEEE Computer, 22(9):47–56, September 1989.

    Article  Google Scholar 

  67. K. M. Chandy and L. Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. on Computer Systems, 3(1):63–75, February 1985.

    Article  Google Scholar 

  68. F. Douglis and J. Ousterhout. Transparent Process Migration: Design Alternatives and the Sprite Implementation. Software — Practice and Experience,1(8):757–785, August 1991.

    Article  Google Scholar 

  69. F. Douglis. Transparent Process Migration in the SPRITE Operating System. Ph.d. thesis, Computer Science Division (EECS). University of California at Berkeley, CA, 1990.

    Google Scholar 

  70. M. R. Es Kicioǧlu. Design Issues of Process Migration Facilities in Distributed Systems. IEEE Technical Commitee on Onerating Systems Newsletter, 4(2):3–13, Winter 1989.

    Google Scholar 

  71. R. Konuru, S. Otto, R. Prouty and J. Walpole. A User-Level Process Package for PVM. In SHPCC ’94, pages 48–55, Knoxville, TN, May 1994. IEEE Computer Society Press.

    Google Scholar 

  72. J. S. Plank and K. Liickp: A Consistent Checkpointer for Multicomputers. IEEE Parallel & Distributed Technoloey, pages 62–67, Summer 1994.

    Google Scholar 

  73. C. Pleier. The Distributed C Programming Environment. Technical Report TUM-I9324, Technische Universität Miinchen 80290 München. September 1993.

    Google Scholar 

  74. C. Pleier. Ein Verfahren zur Prozamigration in heterogenen UNIX-Rechnernetzen. PIK— Praxis der Informationsverarbeitung und Kommunikation,18(2):75–81, April 1995.

    Google Scholar 

  75. G. Stellner. Methoden zur Sicherungspunkterzeugung in parallelen und verteilten Systemen. LRR-TUM Research Report Series. Verlag Shaker, Aachen, October 1996. Reprint of the Phd-thesis which has been submitted to and accepted by the Fakultät für Informatik der Technischen Universität München in July 1996.

    Google Scholar 

  76. M. J. Stratford-Collins. ADA: A Programmers Cconversion Course. Ellis Horwood Limited, Chichester, 1982.

    Google Scholar 

  77. M. M. Theimer, K. A. Lantz and D. R. Cheriton. Preemptable Remote Execution Facilities for the VSystem. In 10th Symposium on Operating System Principles, volume 19 of ACM Operating System Review, pages 2–12, New York, NY, December 1985. ACM Press.

    Google Scholar 

  78. M. M. Theimer and B. Hayes. Heterogeneous Process Migration by Recompilation. In 11th Int. Conf. on Distributed Computing Systems, pages 18–25. IEEE Computer Society Press, 1991.

    Google Scholar 

  79. E. R. Zayas. Attacking the Process Migration Bottleneck. In 11th Symposium on Operating System Principles, volume 21 of ACM Operating System Review, pages 13–24, New York, 1987. ACM Press.

    Google Scholar 

  80. W. Becker. Das HiCon-Modell: Dynamische Lastverteilung für datenintensive Anwendungen in WorkstationNetzen. Technical Report 1994/4, Universität Stuttgart, Fakultät für Informatik, 1994.

    Google Scholar 

  81. W. Becker. Dynamic Balancing Complex Workload in Workstation Networks — Challenge, Concepts and Experiences. In High-Performance Computing and Networking, pages 407–412, Milan, Italy, May 1995. Springer, LNCS 919.

    Google Scholar 

  82. C. Cap and V. Strumpen. The Parform — A High Performance Platform for Parallel Computing in a Distributed Workstation Environment. Technical Report 1992/7, Universität Zürich, Institut für Informatik, 1992.

    Google Scholar 

  83. C. Cap and V. Strumpen. Efficient Parallel Computing in Distributed Workstation Environments. Parallel Computing, 19(11):1221–1234, 1993.

    Article  Google Scholar 

  84. D. L. Eager, E. D. Lazowska and J. Zahorjan. Adaptive Load Sharing in Homogeneous Distributed Systems. IEEE Transactions on Software Engineering, 12(5) 662–675, 1986.

    Article  Google Scholar 

  85. D. Ferguson, Y. Yemini and C. Nikolaou. Microeconomic Algorithms for Load Balancing in Distributed Computer Systems. In Proceedings of the 8 th International Conference on Distributed Computing Systems, San Jose, California, pages 491–499, 1988.

    Google Scholar 

  86. M. Hamdi and C.-K. Lee. Dynamic Load Balancing of Data Parallel Applications on a Distributed Network. In International Conference on Supercomputing, Barcelona, Spain, 1995.

    Google Scholar 

  87. H.-U. Heiss and M. Schmitz. Distributed Load Balancing Using a Physical Analogy. Technical Report 5/92, Universität Karlsruhe, Fakultät f’ur Informatik, May 1992.

    Google Scholar 

  88. H.-U. Heiss and M. Schmitz. Decentralized Dynamic Load Balancing: The Particles Approach. In L. Grün, R. Onvural and E. Gelenbe, editors, In Proc. of the 8th Int. Symp. on Computer and Information Sciences, Instanbul, Turkey, 1993.

    Google Scholar 

  89. H.-U. Heiss and M. Schmitz. Decentralized Dynamic Load Balancing: The Particles Approach. Information Sciences, 84(1+2):115–128, 1995.

    Article  Google Scholar 

  90. K. A. Hua, C. Lee and H. C. Young. Data partitioning for multicomputer database systems: a cell-based approach. Information Systems, 18(5):329–342, 1993.

    Article  Google Scholar 

  91. K. A. Hua and H. C. Young. A Cell—Based Data Partitioning Strategy for Efficient Load Balancing in A Distributed Memory Multicomputer Database System. Technical Report RJ 8041, IBM Research Report, 1991.

    Google Scholar 

  92. E. Rahm and R. Marek. Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. In Proceedings of the 19th International Conference on Very Large Data Bases, Dublin, Ireland, 1993.

    Google Scholar 

  93. P. Scheuermann, G. Weikum and P. Zabback. Automatic Tuning of Data Placement and Load Balancing in Disk Arrays. Technical Report 175, ETH Zürich, April 1992.

    Google Scholar 

  94. V. Strumpen. Parallel Molecular Sequence Analysis on Workstations in the Internet. Technical Report 1993/28, Universität Zürich, Institut für Informatik, 1993.

    Google Scholar 

  95. G. Weikum, P. Zabback and P. Scheuermann. Dynamic File Allocation in Disk Arrays. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, pages 406–415, Denver, Colorado, 1991.

    Chapter  Google Scholar 

  96. R. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice and Experience, 3(5):457–481, 1991.

    Article  Google Scholar 

  97. R. Williams. DIME: Portable Software for Irregular Meshes for Parallel or Sequential Computers. In COMP-CON Spring ’91, pages 68–72, San Francisco, California, February 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität München, Deutschland

    Dr. Thomas Schnekenburger & Dr. Georg Stellner

Authors
  1. Dr. Thomas Schnekenburger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dr. Georg Stellner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität München, Deutschland

    Thomas Schnekenburger  & Georg Stellner  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Schnekenburger, T., Stellner, G. (1997). Surveys and Classifications. In: Schnekenburger, T., Stellner, G. (eds) Dynamic Load Distribution for Parallel Applications. TEUBNER-TEXTE zur Informatik, vol 24. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-01522-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-663-01522-2_2

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-8154-2309-7

  • Online ISBN: 978-3-663-01522-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation