Unbalanced Tree SearchBenchmarking code for unbalanced trees | |
Download |
Unbalanced Tree Search Ranking & Summary
Advertisement
Unbalanced Tree Search Tags
Unbalanced Tree Search Description
The Unbalanced Tree Search or UTS is built as a parallel benchmarking code that is supposed to report the achieved performance when performing an exhaustive search on an unbalanced tree. The tree is generated on the fly using a splittable random number generator (RNG) that allows the random stream to be split and processed in parallel while still producing a deterministic tree. The splittable RNG has been constructed using the SHA1 secure hash algorithm. Thus, generating a node's children requires multiple applications of the SHA1 hash algorithm to generate splittable hashes for each child.
Unbalanced Tree Search Related Software