ppt课件-load balancing- southern oregon university（负载均衡-南俄勒冈大学）.pptVIP

Distributed Work Pool Solution Data held in each processor The graph weights The distances to vertices stored locally The processor assignments When a process receiving a distance: If its local value is reduced Updates its local value of dist[v] Send distances to adjacent vertices to appropriate processors Notes The load can be very imbalanced One of the termination algorithms is necessary * * * * * * Load Balancing How? Partition the computation into units of work (tasks or jobs) Assign tasks to different processors Load Balancing Categories Static (load assigned before application runs) Dyna