Comparison of Dynamic Load Balancing Strategies

H. Kuchen, A. Wagener

	   Parallel implementations of functional programming languages
	   are often based on graph reduction. Tasks represented by task
	   nodes in the graph are generated during run time. These tasks
	   have to be distributed among the processors dynamically. For
	   a prototype implementation of such a language on a loosely
	   coupled multiprocessor system consisting of transputers,
	   we have tested several load balancing strategies.