Abstract
Wegman (1991) introduced a load balancing algorithm for use in parallel computing when the execution times of individual node tasks are not known apriori. This algorithm divides each node task into two subtasks—one of which is assigned immediately to a node and the other used to fill in idle time. Inherent in this algorithm is the selection of a load balancing parameter representing the “fraction” of each task initially assigned to a node. This paper studies the selection of this parameter as a function of the distribution of task execution times and the number of available processing nodes. Several criteria are considered: minimization of the total execution time, maximization of the improvement over sequential processing, and maximization of the improvement over parallel processing without further load balancing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
