ArrayFire is a general-purpose library that simplifies the process of developing software that targets parallel and massively-parallel architectures including CPUs, GPUs, and other hardware acceleration devices.
To achieve this goal, ArrayFire provides software developers with a high-level
abstraction of data which resides on the accelerator, the af::array object
(or C-style struct).
Developers write code which performs operations on ArrayFire arrays which, in turn,
are automatically translated into near-optimal kernels that execute on the computational
device.
ArrayFire is successfully used on devices ranging from low-power mobile phones to
high-power GPU-enabled supercomputers including CPUs from all major vendors (Intel, AMD, Arm),
GPUs from the dominant manufacturers (NVIDIA, AMD, and Qualcomm), as well as a variety
of other accelerator devices on Windows, Mac, and Linux.
Several of ArrayFire's benefits include:
- Easy to use, stable, well-documented API.
- Rigorously Tested for Performance and Accuracy
- Commercially Friendly Open-Source Licensing
- Commercial support from ArrayFire
- Read about more benefits on Arrayfire.com
| Linux x86_64 | Linux armv7l | Linux aarch64 | Windows | OSX | |
|---|---|---|---|---|---|
| Build | |||||
| Test |
You can install the ArrayFire library from one of the following ways:
Execute one of our official binary installers for Linux, OSX, and Windows platforms.
Build from source by following instructions on our wiki.
The following examples are simplified versions of
helloworld.cpp
and
conway_pretty.cpp,
respectively. For more code examples, visit the
examples/
directory.
array A = randu(5, 3, f32); // Create 5x3 matrix of random floats on the GPU
array B = sin(A) + 1.5; // Element-wise arithmetic
array C = fft(B); // Fourier transform the result
float d[] = { 1, 2, 3, 4, 5, 6 };
array D(2, 3, d, afHost); // Create 2x3 matrix from host data
D.col(0) = D.col(end); // Copy last column onto first
array vals, inds;
sort(vals, inds, A); // Sort A and print sorted array and corresponding indices
af_print(vals);
af_print(inds);Visit the Wikipedia page for a description of Conway's Game of Life.
static const float h_kernel[] = {1, 1, 1, 1, 0, 1, 1, 1, 1};
static const array kernel(3, 3, h_kernel, afHost);
array state = (randu(128, 128, f32) > 0.5).as(f32); // Generate starting state
Window myWindow(256, 256);
while(!myWindow.close()) {
array nHood = convolve(state, kernel); // Obtain neighbors
array C0 = (nHood == 2); // Generate conditions for life
array C1 = (nHood == 3);
state = state * C0 + C1; // Update state
myWindow.image(state); // Display
}
You can find our complete documentation here.
Quick links:
We currently support the following language wrappers for ArrayFire:
Wrappers for other languages are a work in progress:
arrayfire-dotnet, arrayfire-fortran, arrayfire-go, arrayfire-java, arrayfire-lua, arrayfire-nodejs, arrayfire-r
Contributions of any kind are welcome! Please refer to CONTRIBUTING.md to learn more about how you can get involved with ArrayFire.
If you redistribute ArrayFire, please follow the terms established in the license. If you wish to cite ArrayFire in an academic publication, please use the following citation document.
ArrayFire development is funded by ArrayFire LLC and several third parties, please see the list of acknowledgements for further details.
- Google Groups
- ArrayFire Services: Consulting | Support | Training
The literal mark “ArrayFire” and ArrayFire logos are trademarks of AccelerEyes LLC DBA ArrayFire. If you wish to use either of these marks in your own project, please consult ArrayFire's Trademark Policy