As distributed memory systems grow larger, communication demands have increased. Unfortunately, while the costs of arithmetic operations continue to decrease rapidly, communication costs have not. As a result, there has been a growing interest in communication-avoiding algorithms for some of the classic problems in numerical computing, including communication-avoiding Fast Fourier Transforms (FFTs).
13 Jan 2021
Source: 11th International Workshop on Polyhedral Compilation Techniques (I...
We present an approach to enhancing the optimization process in a polyhedral compiler by introducing compile-time versioning, i.e., the production…