Concurrency, Parallelism, and Distributed Systems
Concurrency refers to running multiple computations more-or-less simultaneously, whereas parallelism refers to using multiple cores or OS-level threads to coordinate computation. We now know that the former is relatively safe and easy to reason about, whereas the latter is extremely difficult and causes many subtle bugs. OCaml currently supports concurrency elegantly, but parallelism support is not built in to the runtime.
- lwt: a monadic concurrency library.
Concurrent code uses monads to express the higher-level abstractions of control flow.
- lwt-pipe: Stream/queue for lwt.
- Async: another monadic concurrency library developed by Jane Street. This library is covered in Real World OCaml. While the concept is very similar to lwt, small discrepancies make compatibility between the libraries difficult.
- RWO-lwt: Real World OCaml code examples translated from Async to lwt.
- The blog post that introduced Async
- A user gives up on Async
- Cooperative Concurrency in OCaml: Using Async
- The standard library contains the Unix module, which allows for low-level process management. This is fairly brittle due to the fact that it’s mostly (but not entirely) tailored towards Unix.
- lwt has the lwt_process module, which has cross-platform process manipulation functions.
As mentioned above, OCaml currently doesn’t natively support multiple OS-level OCaml threads running simultaneously. A global lock prevents multiple OCaml threads from running simultaneously.
The most promising and powerful way to use multicore is with the new multicore branch. This branch uses a parallel garbage collector, which means that OCaml will eventually be able to run on multiple cores in the same process. Note that this branch is not yet ready for real work, but it’s rapidly advancing. For more information, consult the Multicore Wiki.
Since we currently don’t have thread-level parallelism, process-level is used instead.
- Parmap: Provides easy-to-use parallel map and fold functions. The library makes use of forking to create short-lived child processes, and memory mapping to feed the data back to the parent process.
- Parany: Similar to Parmap, compute a given function over multiple processes in parallel.
- lwt-parallel: Lower level mechanism to create child processes in lwt and have it communicate with the parent via socket.
- ForkWork: Similar to Parmap above.
- By interfacing with external C code through the FFI, OCaml can pass off long-running computations to C threads running at the same time as OCaml code. This is made easier nowadays due to CTypes (see ffi)
- Nproc: A process pool implementation for OCaml using lwt. Rather than creating or forking processes as needd, preallocates them and sends them units of work as required.
- Ocamlnet: An enhanced system platform library. It contains the /netmulticore/ library to compute tasks on as many cores of the machine as needed. This is the most powerful implementation of parellelism currently available for OCaml, as it is capable of creating a shared memory region, and running a custom-made garbage collector on said region.
- Sklml: A functional parallel skeleton compiler and programming system for OCaml programs.
Distributed computing is similar to process-based parallelism, except that the child processes may or may not be on remote (though generally not too remote) machines. Therefore, distributed computing libraries generally can perform parallelism on the same machine.
- Rpc.Parallel: a library for spawning processes on a cluster of machines, and passing typed messages between them.
- Functory: a distributed computing library which facilitates distributed execution of parallelizable computations in a seamless fashion.
- MPI: message Passing Interface bindings for OCaml.
- ocaml-rpc: light library to deal with RPCs in OCaml.
- distributed: Library for distributed computation in OCaml. Similar to Erlang’s model and inspired by Cloud Haskell.
- reactor (alpha): Actor model for OCaml, similar to Erlang Elixir.