14. Optimal Scheduling Results for Parallel Computing
Håkan Lennerstad, Lars E.R. Lundberg · Society for Industrial and Applied Mathematics eBooks · 1996
Editorial preface Load balancing is one of many possible causes of poor performance on parallel machines. If good load balancing of the decomposed algorithm or data is not achieved, much of the potential gain of the parallel algorithm is lost to idle processors. Each of the two extremes for load balancing—static allocation and dynamic allocation—has advantages and disadvantages. This chapter illustrates the relationship between static and dynamic allocation of tasks.