ILNumerics Accelerator Compiler
ILNumerics Accelerator compiler has one goal: to speed-up general array algorithms. Currently, it supports algorithms created with ILNumerics Computing Engine.
The compiler was developed by ILNumerics GmbH. It realizes many new optimizations – not only on a low scalar data level (as LLVM and others do). Additionally, it considers and optimizes larger chunks of code on a higher abstraction level of array functions and above. It gives the executing computer great freedom to make important decisions autonomously and at runtime.
These desisions include: the set of array instructions to be merged into larger segments, the selection of the most suited hardware resource available, the specialized, low level, optimized implementation on the selected hardware, scheduling of segments onto available compute resources, cross-device memory management, to name only a few. It lets the computer decide how to execute your algorithm fastest - instead of a programmer!
The initial release of ILNumerics Accelerator focusses on fundamental unary, binary, reduce and generator array instructions. Support for more complex instructions, as FFT, linear algebra, optimizations, interpolations, and more is planned. As the ultimate goal all parts of an algorithm comprise of supported ILNumerics array instructions. Such regions will be utilizing all parallel compute resources - with optimal efficiency.
The documentation for ILNumerics Accelerator is structured into the following sections: