The scalability analysis of a parallel tree search algorithm (Q5919087)
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: The scalability analysis of a parallel tree search algorithm |
scientific article; zbMATH DE number 7311813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The scalability analysis of a parallel tree search algorithm |
scientific article; zbMATH DE number 7311813 |
Statements
The scalability analysis of a parallel tree search algorithm (English)
0 references
17 February 2021
0 references
The present paper deals with the scalability analysis associated with a parallel tree search algorithm. Moreover, there is shown that this parallel algorithm is close to the theoretical maximum.
0 references
parallel scalability
0 references
parallel efficiency
0 references
complexity analysis
0 references
parallel tree search
0 references
global optimization
0 references
0 references
0 references
0 references
0.967086672782898
0 references
0.7229801416397095
0 references
0.7148804664611816
0 references
