|
Let W be serial work and WP be parallel work. Search overhead factor s is defined as WP/W
|
səhifə | 12/23 | tarix | 26.12.2016 | ölçüsü | 0,99 Mb. | | #3369 |
|
How is the search space partitioned across processors? Different subtrees can be searched concurrently. However, subtrees can be very different in size. It is difficult to estimate the size of a subtree rooted at a node. Dynamic load balancing is required.
The unstructured nature of tree search and the imbalance resulting from static partitioning.
|
|
|