e computation of a task is parallelized with OpenMP, looping in a way that guarantees a safe write access to W, avoiding the need of a lock. When idle, a slave process requests a task to the ZeroMQ task server, computes the corresponding result and sends it to the collector thread of the master instance via ZeroMQ. As the OpenMP tasks are not guaranteed to be balanced, we have used a dynamic scheduling, with a chunk size of 64 elements.