.png){kind=icon}
.png){kind=icon}
Return
Application-tailored linear algebra algorithms: A search-based approach
.png){kind=icon}
PRE
AI
DOI：10.1177/1094342013494428.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we tackle the problem of automatically generating algorithms for linear algebra operations by taking advantage of problem-specific knowledge. In most situations, users possess much more information about the problem at hand than what current libraries and computing environments accept; evidence shows that if properly exploited, such information leads to uncommon/unexpected speedups. We introduce a knowledge-aware linear algebra compiler that allows users to input matrix equations together with properties about the operands and the problem itself; for instance, they can specify that the equation is part of a sequence, and how successive instances are related to one another. The compiler exploits all of this information to guide the generation of algorithms, to limit the size of the search space, and to avoid redundant computations. We applied the compiler to equations arising as part of sensitivity and genome studies. For the first application, the algorithms produced by our compiler attained, when compared with ADIFOR, speedups of between 29x and 79x. In the case of genome studies, the produced algorithms outperformed the state-of-the-art libraries GenABEL and FaST-LMM by factors beyond 1000.
Keywords:
automation
domain-specific languages
domain-specific compilers
numerical linear algebra
generation of algorithms
knowledge management
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.1K
Citations:
1.3K