Search results

* [[UTS]] - The Unbalanced Tree Search benchmark is an irregular parallel benchmark.

* '''Efficient Search-Space Pruning for Integrated Fusion and Tiling Transformations'''. X. Gao, * '''Search-Based Performance-Model Driven Optimization for Compilation of Tensor Contr

operations into a sequence of binary contractions, coupled with a global search of the ...ite single-term solution space for factorization opportunities. Exhaustive search

...g code that reports the performance achieved when performing an exhaustive search on an unbalanced tree. The tree is generated on the fly using a splittable '''UTS: An Unbalanced Tree Search Benchmark''' [http://www.mcs.anl.gov/~dinan/research/uts/olivier_lcpc06.pdf