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.
What's New in This Release: [ read full changelog ]
· Added uts_upc_enhanced to the distribution.
Find us on Google+
