Search results
From HPCRL Wiki
- * [[UTS]] - The Unbalanced Tree Search benchmark is an irregular parallel benchmark.4 KB (455 words) - 22:29, 8 April 2019
- * '''Efficient Search-Space Pruning for Integrated Fusion and Tiling Transformations'''. X. Gao, * '''Search-Based Performance-Model Driven Optimization for Compilation of Tensor Contr14 KB (1,809 words) - 05:18, 14 December 2007
- operations into a sequence of binary contractions, coupled with a global search of the ...ite single-term solution space for factorization opportunities. Exhaustive search4 KB (629 words) - 23:12, 15 October 2018
- ...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.pdf4 KB (655 words) - 12:03, 20 March 2013