Workflows written using Chapel scale enormously. The same code written on your laptop can perform on however many nodes you can give it, be it one, dozens, or thousands. Applications written by Chapel users have successfully scaled to more than 8,000 compute nodes, 1,000,000 CPU cores, and 1,000 GPUs. The largest supercomputers in the world run Chapel. No matter the scale of your system, you can scale too.
Scaling Results with Chapel
Arkouda Argsort
Arkouda's argsort routine can sort 256 TiB of data in just 31 seconds, scaling to more than 8,000 nodes. All in around 100 lines of Chapel code.
NAS FT
Computes the FFT of a distributed 3D array by computing 1D FFTs and transposing to localize other dimensions.
GPU Scaling
Stream
The de facto industry standard benchmark for measuring memory performance. Calculates element-wise triad.
Stencil
Measures the performance of applying a radius-2 star stencil to a distributed 2D array. Emphasizes the performance of nearest-neighbor communication.
Random Access
Measures the performance of concurrent random updates of a distributed array.
Why Chapel Makes Scaling Easier
Global View of Data
Chapel has built-in support for distributed global arrays, meaning computations written for a single node can run on an entire cluster.