Year-end Sale % OFF 
Abstract
In this paper, we describe the design and implementation of a reusable load balancer for parallelsearch problems. Parallel search problems are a significant research topic in the parallel processing area: these applications expose irregularities that require dynamic load balancing techniques. Software for dynamic load balancing should be reusable. Our load balancer can be developed independently from the application -and thus be replaced and reused- as it does not directly interact with the application itself. Our prototype implementation runs on a transputer system; we used different load balancing strategies: sender-initiated, receiver-initiated and symmetrically-initiated. The modularity of our load balancer is illustrated by the fact that we could easily replace the load balancer by different alternatives and compare the performance results.
Published Version
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.
