This version demonstrated the original problem. A group of MPI ranks process work items repeatedly. After every iteration completes, some information is exchanged among neighbouring ranks and the throughput, i.e. the total numner pf processed work items is reported. At some point, rank 0 starts adding more work items and it can be observed how the throughput decreases.