A new load-balancing strategy for the solution of dynamical large-tree search problems using a hierarchical approach
Journal Article
·
· IBM Journal of Research and Development
We describe a new load-balancing strategy, applied here to the protein conformational search problem, for improving the efficiency of the hierarchical approach when dealing with coarse-grained problems associated with large tree searches. Unlike other load-balancing strategies that reassign load from the heavily loaded processors to the lightly loaded or idle ones, the proposed strategy changes the virtual communication tree among the processors as the computational tree changes. The strategy incurs minimal overhead and is scalable.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director, Office of Science; National Science Foundation (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 836544
- Report Number(s):
- LBNL-53732; IBMJAE; R&D Project: 365963; TRN: US200503%%781
- Journal Information:
- IBM Journal of Research and Development, Vol. 48, Issue 2; Other Information: Journal Publication Date: February 2004; PBD: 25 May 2004; ISSN 0018-8646
- Publisher:
- IEEE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Dynamic process migration for load balancing in distributed systems
Processor assignment in distributed-memory multiprocessor systems
Distributed game-tree searching
Thesis/Dissertation
·
Wed Jan 01 00:00:00 EST 1986
·
OSTI ID:836544
Processor assignment in distributed-memory multiprocessor systems
Miscellaneous
·
Mon Jan 01 00:00:00 EST 1990
·
OSTI ID:836544
Distributed game-tree searching
Journal Article
·
Wed Feb 01 00:00:00 EST 1989
· Journal of Parallel and Distributed Computing; (USA)
·
OSTI ID:836544