When Elixir's performance becomes Rust-y
Published: 2021-02-01 09:56:15

---
title: When Elixir's performance becomes Rust-y
published: true
date: 2020-01-14 00:00:00 UTC
tags: 
canonical_url: https://www.kabisa.nl/tech/when-elixirs-performance-becomes-rust-y/
---

Elixir is a good language to develop fault tolerant and predictable, performant systems. However for heavy computational work it’s less suitable. How can we keep using Elixir for the things it’s good at, but achieve better performance for computational heavy work?

The post assumes basic Elixir knowledge. Rust knowledge is not required.

## The use case

In this use case, we want to calculate the prime numbers in the range of 1 up to 1 million. I’d like to show off something a bit more computational intensive than a simple addition of numbers, and also show that Elixir data types map well into Rust.

The code passes a list of numbers instead of just an integer denoting the maximum, to show off that data structures such as lists also translate fine between Elixir and Rust. There are a lot more efficient algorithms available for determining prime numbers, but this approach is fine to show the performance difference.

## Starting off with pure Elixir

So let’s get coding! We’ll start off with the Elixir implementation after making a new project. In this example the project is called `rust_nif`.

```

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

defmodule RustNif.ElixirPrimes do
  # http://erlang.org/doc/efficiency_guide/listHandling.html
  def prime_numbers(numbers) do
    prime_numbers(numbers, [])
  end

  defp prime_numbers([], result) do
    {:ok, result |> Enum.reverse() }
  end

  defp prime_numbers([number | rest], result) do
    new_result = result
    |> add_if_prime_number(number)

    prime_numbers(rest, new_result)
  end

  defp add_if_prime_number(numbers, 1), do: numbers

  defp add_if_prime_number(numbers, 2) do
    [2 | numbers]
  end

  defp add_if_prime_number(numbers, n) do
    range = 2..(n - 1)
    case Enum.any?(range, fn x -> rem(n, x) == 0 end) do
      false -> [n | numbers]
      _ -> numbers
    end
  end
end

time = Time.utc_now
result = Enum.into(1..100000, []) |> RustNif.ElixirPrimes.prime_numbers()
execution_time = Time.diff Time.utc_now, time
IO.puts "Elixir task finished after #{execution_time} seconds"
IO.inspect(result)

```

We prepend each number to the list, and reverse the list in the final result. See [this section](http://erlang.org/doc/efficiency_guide/listHandling.html) as to why we do this.Running this, the results on my machine were:

```

1
2
3
4
5

{:ok,
 [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
  73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
  157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, ...]}
Elixir task finished after 33 seconds

```

That takes quite some time. Surely we can do better.

## So what are our alternatives?

### Ports & Nifs

We could resort to ports or NIFs, if you would want to improve this by writing it in another language.There’s a good summary of ports and nifs here: https://spin.atomicobject.com/2015/03/16/Elixir-native-interoperability-ports-vs-nifs/

In short:

Ports:

- Safety
- Error trapping
- Flexible communication
- No external Erlang/Elixir specific libraries required
- Communication via STDIN and STDOUT

NIFS:

- Fast and simple implementationn
- No context switch required
- Simple debugging
- Not very safe (a bug in your NIF could crash the whole VM)
- NIF-specific C libraries
- Native implementation can leak into Elixir code

### (Web) service

We could define a separate web service, exposing an API that could handle this, in a language better suited for computation heavy tasks. We’d need to add a new service to our stack though, and also account for potential network failures and sending potentially large payloads.

### Background job

Depending on the case, it would be acceptable to move this computation into a background task (we don’t need to return the immediate result to the end user). But in our scenario, this isn’t the case

### Summary

A NIF looks nice at a glance, but we’d need to eliminate the risk of the NIF being able to crash the beam VM. But what if I told you that we can do that?

## Introducing Rust

This is where Rust comes in. Rust is a low level language, like C, developed by Mozilla. It’s designed to provide better memory safety than C does, while also maintaining solid performance.

There’s a library which allows creating Elixir/Erlang NIF’s which make use of Rust, called [rustler](https://github.com/rusterlium/rustler). One of its main features is that its safety should prevent the Beam from crashing if something unexpected happens. In the meanwhile, we get to leverage Rust’s performance in our Elixir apps when we need it!

### Writing the Rust code

Disclaimer: I don’t have much prior knowledge with Rust, I’m sure this code can be improved. We have to start somewhere!

We’ll go through the code piece by piece, the total solution will be posted at the end of the article.

The first thing we need to do is add rustler to the project, so let’s do that!Let’s add `{:rustler, "~> 0.21.0"}`, to our dependencies in `mix.exs` and install it with `mix deps.get`.

That’ll allow us to run `mix rustler.new`. Let’s call our module `PrimeNumbers` (which will call the rust crate `primenumbers` by default, which is fine).

We’ll also need to add rustler as compiler in the project, and define our Rust crate.

```

1
2
3
4
5
6
7
8

def project
  [
    compilers: [:rustler, :phoenix, :gettext] ++ Mix.compilers(),
    rustler_crates: [
      primenumbers: []
    ],
    ... # other project options
  ]

```

Let’s start writing the Rust code! there will be a rust file at `native/primenumbers/src/lib.rs`, which looks like this currently:

```

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

use rustler::{Encoder, Env, Error, Term};

mod atoms {
    rustler_atoms! {
        atom ok;
        atom error;
        //atom __true__ = "true";
        //atom __false__ = "false";
    }
}

rustler::rustler_export_nifs! {
    "Elixir.PrimeNumbers",
    [
        ("add", 2, add)
    ],
    None
}

fn add<'a>(env: Env<'a>, args: &[Term<'a>]) -> Result<Term<'a>, Error> {
    let num1: i64 = args[0].decode()?;
    let num2: i64 = args[1].decode()?;

    Ok((atoms::ok(), num1 + num2).encode(env))
}

```

The first statement imports the Encoder, Env, Error and Term types from rustler, so we can make use of them.The atoms section declares atoms which will map to Elixir’s :ok annd :error atoms, so we can provide an interface similar to Elixir.

Methods defined in the `rustler::rustler_export_nifs!` statement are made available to Elixir, in the PrimeNumbers module. In the example, `add` is exported and defined with an arity of 2.

The add function decodes the arguments that are provided, adds them together and yields them back to Elixir as `{:ok, <result>}`. (Although I won’t dive deeper into it, rustler makes this possible by implementing the [External Term Format](http://Erlang.org/doc/apps/erts/erl_ext_dist.html)).

So let’s modify that so we can get us some prime numbers.

```

1
2
3
4
5
6
7
8

use rustler::{Encoder, Env, Error, Term};

mod atoms {
    rustler::rustler_atoms! { // <- We actually prefixed this with rustler! it's a small oversight in the template generation. see https://github.com/rusterlium/rustler/issues/260
        atom ok;
        atom error;
    }
}

```

The first part remains the same, we’ll declare the ok and error atoms for use with Elixir.

```

1
2
3
4
5
6
7

rustler::rustler_export_nifs! {
    "Elixir.RustNif.PrimeNumbers",
    [
        ("prime_numbers", 1, prime_numbers, rustler::SchedulerFlags::DirtyCpu)
    ],
    None
}

```

We’ll register a `prime_numbers` method to rustler with an arity of 1 to be exported. This will be made available to Elixir.

One important addition we’ve made compared to the given example is to mark the function as being a ‘Dirty NIF’ by sending along `SchedulerFlags::DirtyCpu`. It’s important to mark your NIF as ‘Dirty’ if their operation will take longer than a millisecond to complete. Not doing so could result in blocking your main operation in the Beam VM, potentially causing weird side effects.More information about this behavior can be found in the [Erlang documentation](http://erlang.org/doc/man/erl_nif.html#dirty_nifs). (Thank you for this addition, Redmar Kerkhoff!)

```

1
2
3
4
5
6
7
8
9

fn is_prime_number(x: i64) -> bool {
    let end_of_range = x - 1;

    if x == 1 {
        false
    } else {
        !(2..end_of_range).any(|num| x % num == 0)
    }
}

```

We’ll define a method to determine whether a number is a prime number. It accepts the number as argument and returns a boolean.

```

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

fn prime_numbers<'a>(env: Env<'a>, args: &[Term<'a>]) -> Result<Term<'a>, Error> {
    let is_list: bool = args[0].is_list();

    if !is_list {
        Ok((atoms::error(), "No list supplied").encode(env))
    } else {
        let numbers: Vec<i64> = args[0].decode()?;
        let mut vec = Vec::new();

        for number in numbers {
            if is_prime_number(number) {
                vec.push(number)
            }
        }

        Ok((atoms::ok(), &*vec).encode(env))
    }
}

```

We can use the same function signature that the example add function used (note the <’a> are [lifetimes](https://doc.rust-lang.org/book/ch10-03-lifetime-syntax.html), not generics or similar).

In this case we will verify whether the first argument is a list, and stop the function and yield `{:error, "No list suppled"}` if it’s not.

Afterwards, we use rustler’s `decode()` method to convert the data type into a Vec of `i64`. We’ll make a mutable Vec (you need to specify mutability explicitely in Rust), and loop through the numbers to determine the prime number. If a number is determined to be a prime number, we push it into the Vec.

### Glueing Elixir and Rust together

We’ll need a module in Elixir that will be the interface to the Rust code. The module name corresponds to the name known in the Rust code.

```

1
2
3
4
5
6
7

# prime_numbers.ex
defmodule RustNif.PrimeNumbers do
  use Rustler, otp_app: :rust_nif, crate: :primenumbers

  # Overriden when module is loaded
  def prime_numbers(_nums), do: :erlang.nif_error(:nif_not_loaded)
end

```

We define the OTP app we use, and the Rust crate we’re loading, and that’s it.

## Comparison of performance

Now that we have both the Elixir and Rust(Elixir) versions of the code, let’s compare them on their execution speed!

```

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

defmodule Benchmark do
  def benchmark do
    Process.spawn(fn -> benchmark_elixir() end, [:link])
    Process.spawn(fn -> benchmark_rust() end, [:link])
    nil
  end

  def benchmark_elixir do
    time = Time.utc_now
    result = Enum.into(1..100000, []) |> RustNif.ElixirPrimes.prime_numbers()
    execution_time = Time.diff Time.utc_now, time

    IO.inspect result
    IO.puts "Elixir task finished after #{execution_time} seconds"
  end

  def benchmark_rust do
    time = Time.utc_now
    result = Enum.into(1..100000, []) |> RustNif.PrimeNumbers.prime_numbers()
    execution_time = Time.diff Time.utc_now, time

    IO.inspect result
    IO.puts "Rust task finished after #{execution_time} seconds"
  end
end

iex(1)> Benchmark.benchmark
nil
{:ok,
 [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
  73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
  157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, ...]}
Rust task finished after 4 seconds
{:ok,
 [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
  73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
  157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, ...]}
Elixir task finished after 33 seconds

```

Well that’s quite a lot better!

## Do other people do this?

Yes! An example of a company having this setup is Discord, see [Using Rust to Scale Elixir for 11 Million Concurrent Users](https://blog.discordapp.com/using-rust-to-scale-Elixir-for-11-million-concurrent-users-c6f19fc029d3)

## Conclusion

Let me preface the conclusion by stating you shouldn’t just introduce Rust in your Elixir stack like this because you _think_ you’ll need it.

It’s great to see the ease in which a low level, but safe language such as Rust, can be added to our stack to overcome one of Elixir’s weaker points with relative ease.

I’m sure both implementations can be further refined. The point that I want to make is that it’s easy to resort to a more performant language when need does arise.

## The full code samples

```

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

# Elixir_primes.ex
defmodule RustNif.ElixirPrimes do
  # http://erlang.org/doc/efficiency_guide/listHandling.html
  def prime_numbers(numbers) do
    prime_numbers(numbers, [])
  end

  defp prime_numbers([], result) do
    {:ok, result |> Enum.reverse() }
  end

  defp prime_numbers([number | rest], result) do
    new_result = result
    |> add_if_prime_number(number)

    prime_numbers(rest, new_result)
  end

  defp add_if_prime_number(numbers, 1), do: numbers

  defp add_if_prime_number(numbers, 2) do
    [2 | numbers]
  end

  defp add_if_prime_number(numbers, n) do
    range = 2..(n - 1)
    case Enum.any?(range, fn x -> rem(n, x) == 0 end) do
      false -> [n | numbers]
      _ -> numbers
    end
  end
end



1
2
3
4
5
6
7

# prime_numbers.ex
defmodule RustNif.PrimeNumbers do
  use Rustler, otp_app: :rust_nif, crate: :primenumbers

  # Overriden when module is loaded
  def prime_numbers(_nums), do: :erlang.nif_error(:nif_not_loaded)
end



1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

// lib.rs
use rustler::{Encoder, Env, Error, Term};

mod atoms {
    rustler::rustler_atoms! {
        atom ok;
        atom error;
    }
}

rustler::rustler_export_nifs! {
    "Elixir.RustNif.PrimeNumbers",
    [
        ("prime_numbers", 1, prime_numbers, rustler::SchedulerFlags::DirtyCpu)
    ],
    None
}

fn is_prime_number(x: i64) -> bool {
    let end_of_range = x - 1;

    if x == 1 {
        false
    } else {
        !(2..end_of_range).any(|num| x % num == 0)
    }
}

fn prime_numbers<'a>(env: Env<'a>, args: &[Term<'a>]) -> Result<Term<'a>, Error> {
    let is_list: bool = args[0].is_list();

    if !is_list {
        Ok((atoms::error(), "No list supplied").encode(env))
    } else {
        let numbers: Vec<i64> = args[0].decode()?;
        let mut vec = Vec::new();

        for number in numbers {
            if is_prime_number(number) {
                vec.push(number)
            }
        }

        Ok((atoms::ok(), &*vec).encode(env))
    }
}

```