Virtual data space - A universal load balancing scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1253, Issue , 1997, Pages 159-166

  Decker, Thomas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL LIBRARIES; SCHEDULING ALGORITHMS;

LOAD-BALANCING MECHANISMS; LOAD-BALANCING SCHEMES; PARALLEL APPLICATION; PRECEDENCE CONSTRAINTS; PROCESSING NODES; SYNTHETIC BENCHMARK; VIRTUAL DATA;

BENCHMARKING;

EID: 21744452069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63138-0_15     Document Type: Conference Paper

References (16)

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).
2. R. D. Blumofe, C. F. 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.
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.
4. G. Cybenko: Dynamic Load Balancing for Distributed Memory Multiprocessors, J. of Parallel and Distributed Computing 7 (1989) pp. 279-301.
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.
6. T. Decker: The Virtual Data Space Reference Manual, http://www.unipaderborn.de/SFB376/projects/a2/TP_A2_VDS.ManualE.html.
7. T. Decker, R. Diekmann, R. Lüling, B. Monien: Towards Developing Universal Dynamic Mapping Algorithms, 7th IEEE Symp. on ParaUel and Distributed Processing, SPDP'95, 1995, pp. 456-459.
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.
9. B. Freisleben, T. Kielmann: Approaches to Support Parallel Programming on Workstation Clusters: A Survey, Informatik Berichte, Fachgruppe Informatik, Universität-GH Siegen, (95-01), 1995.
10. A. S. Grimshaw: Easy to Use Object-Oriented Parallel Programming with Mentat, IEEE Computer, pp. 39-51, May, 1993.
11. N.R. Mahapatra, S. Dutt.: Random Seeking: A General, Effcient, and Informed Randomized Scheme for Dynamic Load Balancing, 10th IEEE ParalM Processing Symp., pp. 881-885, 1996.
12. A. J. Piper, R. W. Prager: Generalized Parallel Programming with Divideand- Conquer: The Beeblebrox System, Technical Report, Cambridge University Engeneering Department, CUED/F-INFENG/TR132, 1993.
13. T. Schnekenburger: The ALDY Load Distribution System, SFB-Bericht 342/11/95 A, Technische Universitaet Muenchen, 1995.
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.
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.
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.