MulticoreBSP for C  Version 2.0.4
Bug List
Global bsp_push_reg (void *const address, const bsp_size_t size)
Due to an implementation choice, the overhead of pushing k variables across all SPMD processes is k^2. This is no issue if k is small, and scales in a realistic sense if $ k^2 \leq P $. An alternative implementation could reduce this overhead cost to $ k\log k $ (red/black tree, worst case) or k (hashmap, average case) albeit at the cost of using (increasingly) more memory. Contact the maintainers if this variant is indeed preferable.