Virtual Data Space-A Universal load balancing scheme | SpringerLink
Skip to main content
Springer Nature Link
Log in

Virtual Data Space-A Universal load balancing scheme

  • Scheduling and Load Balancing
  • Conference paper
  • First Online:
Solving Irregularly Structured Problems in Parallel (IRREGULAR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1253))

Abstract

The Virtual Data S pace is a standard C-library which automatically distributes the work-packets generated by parallel applications across the processing nodes. VDS is a universal system offering loadbalancing-mechanisms for applications which incorporate independent load-items and scheduling algorithms for those which comprise precedence-constraints between their different tasks. This paper presents the concepts of VDS and shows some performance results obtained by synthetic benchmark applications.

This work is supported by the “DFG Sonderforschungsbereich 376: Massive Parallelität — Algorithmen, Entwurfsmethoden, Anwendungen” and by the EU ESPRIT Long Term Research Project 20244 (ALCOM-IT).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Arabe, A. Beguelin, B. Lowekamp, E. Seligman, M. Starkey, P. Stephan: Dome: Parallel Programming in a Heterogeneous Multi-User Environment, Proc. International Parallel Processing Symposium 1996 (IPPS 96).

    Google Scholar 

  2. R. D. Blumofe, C. P. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, Y. Zhou: Cilk: An Efficient Multithreaded Runtime System, Proc. of th 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, (PPOPP '95), pp. 207–216, 1995.

    Google Scholar 

  3. R. D. Blumhofe, C. E. Leiserson: Scheduling Multithreaded Computations by Work Stealing, Proc. 36th Ann. Symposium on Foundations of Computer Science (FOCS '95), pp. 356–368, 1995.

    Google Scholar 

  4. G. Cybenko: Dynamic Load Balancing for Distributed Memory Multiprocessors J. of Parallel and Distributed Computing 7 (1989) pp. 279–301.

    Google Scholar 

  5. N. Carriero, D. Gelernter, T. G. Mattson, A. H. Sherman: The Linda Alternative to Message-Passing Systems, Parallel Computing, 20(4):633–655, 1994.

    Google Scholar 

  6. T. Decker: The Virtual Data Space Reference Manual, http://www.uni-paderborn.de/SFB376/projects/a2/TP_A2_VDS_ManualE.html.

    Google Scholar 

  7. T. Decker, R. Diekmann, R. Lüling, B. Monien: Towards Developing Universal Dynamic Mapping Algorithms, 7th IEEE Symp. on Parallel and Distributed Processing, SPDP'95, 1995, pp. 456–459.

    Google Scholar 

  8. P. Fatourou, P. Spirakis: Scheduling Algorithms for Strict Multithreaded Computations, Proc. 7th Annual International Symposium on Algorithms and Computation (ISAAC '96), pp. 407–416, Osaka, Japan, December 1996.

    Google Scholar 

  9. B. Freisieben, T. Kielmann: Approaches to Support Parallel Programming on Workstation Clusters: A Survey, Informatik Berichte, Fachgruppe Informatik, Universität-GH Siegen, (95-01), 1995.

    Google Scholar 

  10. A. S. Grimshaw. Easy to Use Object-Oriented Parallel Programming with Mentat, IEEE Computer, pp. 39–51, May, 1993.

    Google Scholar 

  11. N.R. Mahapatra, S. Dutt: Random Seeking: A General, Efficient, and Informed Randomized Scheme for Dynamic Load Balancing, 10th IEEE Parallel Processing Symp., pp. 881–885, 1996.

    Google Scholar 

  12. A. J. Piper, R. W. Prager: Generalized Parallel Programming with Divide-and-Conquer: The Beeblebrox System, Technical Report, Cambridge University Engeneering Department, CUED/F-INFENG/TR132, 1993.

    Google Scholar 

  13. T. Schnekenburger: The ALDY Load Distribution System, SFB-Bericht 342/11/95 A, Technische Universitaet Muenchen, 1995.

    Google Scholar 

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

    Google Scholar 

  15. C.-Z. Xu, B. Monien, R. Lüling, F. C. M. Lau: An Analytical Comparison of Nearest Neighbour Algorithms for Load Balancing in Parallel Computers Proc. of International Parallel Processing Symposium (IPPS'95), pp. 472–479, 1995.

    Google Scholar 

  16. C.-Z. Xu, S. Tschöke, B. Monien: Performance Evaluation of Load Distribution Strategies in Parallel Branch and Bound Computations Proc. 7th Symposium on Parallel and Distributed Processing (SPDP'95), pp. 402–405, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, Germany

    Thomas Decker

Authors
  1. Thomas Decker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gianfranco Bilardi Afonso Ferreira Reinhard Lüling José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Decker, T. (1997). Virtual Data Space-A Universal load balancing scheme. In: Bilardi, G., Ferreira, A., Lüling, R., Rolim, J. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1997. Lecture Notes in Computer Science, vol 1253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-63138-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63138-5

  • Online ISBN: 978-3-540-69157-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation