A data-parallel view of the load balancing experimental results on MasPar MP-1

1. A. Corradi, L. Leonardi, and F. Zambonelli. Load balancing strategies for massively parallel architectures. Parallel Processing Letters, 2, 1992.

   Google Scholar 

2. George Cybenko. Dynamic load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 7, 1989.

   Google Scholar 

3. Alan Dewdney. Computer recreations: A computer microscope zooms in for a look at the most complex object in mathematics. Scientific American, page 16, August 1985.

   Google Scholar 

4. Raphael Finkel and Udi Manber. DIB-a distributed implementation of backtracking. ACM Transactions on Programming Languages and Systems, 9(2), 1987.

   Google Scholar 

5. Cyril Fonlupt, Philippe Marquet, and Jean-Luc Dekeyser. Dynamic data redistribution on SIMD data-parallel computers. Technical report, Université de Lille I, Lille, France, 1993.

   Google Scholar 

6. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman, 1979.

   Google Scholar 

7. Cyril Gavoille. Evaluation of the MasPar performances. Technical report, Ecole Normale Supérieure de Lyon, Lyon, France, February 1992.

   Google Scholar 

8. Dimitris Gerogiannis and Stelios C. Orphanoudakis. Load balancing requirements in parallel implementation of image feature extraction tasks. IEEE Transactions on Parallel and Distributed Systems, 4(9):994, September 1993.

   Google Scholar 

9. Wouter Joosen, Stijn Bijnens, and Pierre Verbaeten. A reusable load balancer for parallel search problems. In Euromicro 93, Barcelona, September 1993.

   Google Scholar 

10. George Karypis and Vipin Kumar. Unstructured tree search on SIMD parallel computers: A summary of results. In Supercomputing 92, 1992.

    Google Scholar 

11. Richard E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27:97, 1985.

    MathSciNet  Google Scholar 

12. Vipin Kumar and V. Nageshwara Rao. Parallel depth first search. part II. Int'l Journal of Parallel Programming, 16(6), 1987.

    Google Scholar 

13. F. Lin and R. Keller. The gradient model load balancing method. IEEE Transactions on Software Engeneering, 13(1):32, January 1987.

    Google Scholar 

14. Ambuj Mahanti and Charles J. Daniels. A SIMD approach to parallel heuristic search. Artificial Intelligence, 60:243, 1993.

    MathSciNet  Google Scholar 

15. Lionel M. Ni, Chong-Wei Xu, and Thomas B. Gendreau. A distributed drafting algorithm for load balancing. IEEE Transactions on Software Engeneering, 11(10), October 1985.

    Google Scholar 

16. D. Nicol and J. Saltz. Dynamic remapping of parallel computations with varying resource demands. IEEE Transactions on Computers, 37(9):1073, September 1988.

    Google Scholar 

17. Curt Powley, Chris Ferguson, and Richard Korf. Depth-first heuristic search on a SIMD machine. Artificial Intelligence, 60, 1993.

    Google Scholar 

18. Lutz Prechelt. Measurements of MasPar MP-1216A communication operations. Technical report, Universität Karlsruhe, 1992.

    Google Scholar 

19. R.McConnell and R.H. Perrott. A hybrid load balancing scheme for distributed memory multiprocessors. Technical report, The Queen's University, Belfast, Northern Ireland, 1993.

    Google Scholar 

20. Eli Shamir and Eli Upfal. A probabilistic approach to the load-sharing problem in distributed systems. Journal of Parallel and Distributed Computing, 4, 1987.

    Google Scholar 

21. Sherryl Tomboulian and Matthew Pappas. Indirect addressing and load balancing for faster solution to mandelbrot set on SIMD architectures. In Frontiers 91, 1991.

    Google Scholar 

22. Shirley A. William. Models for Parallel Systems. Wiley, 1990.

    Google Scholar 

Download references