A parallel interval method implementation for global optimization using dynamic load balancing (Q1899458)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel interval method implementation for global optimization using dynamic load balancing |
scientific article; zbMATH DE number 803789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel interval method implementation for global optimization using dynamic load balancing |
scientific article; zbMATH DE number 803789 |
Statements
A parallel interval method implementation for global optimization using dynamic load balancing (English)
0 references
14 March 1996
0 references
Interval analysis provides a prototype algorithm for solving global optimization problems that are restricted to a box. This prototype is a sequential algorithm based on a branch-and-bound principle. -- In the paper, the prototype algorithm is modified in order to meet the requirements of parallelization. I.e., several decentralized dynamic load balancing versions are investigated where the schedulers consider the quantity as well as the quality of the tasks.
0 references
branch-and-bound algorithm
0 references
parallel computation
0 references
interval analysis
0 references
global optimization
0 references
dynamic load balancing
0 references
0.8937395
0 references
0.8921943
0 references
0.8896737
0 references
0.88658977
0 references
