This is the authors' abstract. We don't add key points for this paper.
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformations, and blocking. The best solution to these choices is often tightly coupled to different architectures, problem sizes, data, and available system resources. In some cases, completely different algorithms may provide the best performance. Current compiler and programming language techniques are able to change some of these parameters, but today there is no simple way for the programmer to express or the compiler to choose different algorithms to handle different parts of the data. Existing solutions normally can handle only coarse-grained, library level selections or hand coded cutoffs between base cases and recursive cases.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Ansel et al. (2009) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: