Work

Load Balancing in Multiprocessor Systems

Year: 1989
Type: article
Abstract: TERMS (Continue on reverse if necessary and identify by block number) load balancing, scheduling, multiprocessor, shared memoryWe present an algorithm for dynamic load balancing in a multiprocessor system that minimizes the number of accesses to the shared memory.The algorithm assumes no information, probabilistic or otherwise, regarding task arrivals or processing requirements.For k processors to process n tasks, the algorithm incurs 0 0fc log k log n ) potential memory collisions in the worst case.The algorithm itself is a simple variation of the strategy of visiting the longest queue.The key idea is to delay reporting task arrivals and completions, where the delay is a function of dynamic loading conditions.
Language: English
Open Access status: green
OpenAlex ID: W117168283
FWCI:
Cites: 3
Cited by: 1
Related to: 10