Given the DGRP composition (some processes are recommended, others non-recommended, and only recommended processes run the algorithm), a mapping function was implemented to define the partners p i and p j in a sorting round.
Sets of recommendations that were clearly linked to one another were grouped to form 'composite' recommendations (e.g. the nine recommended processes of care for patients with Type 2 diabetes [ 25]).
The following scenarios were executed: (1) only recommended processes, (2) only one process becomes non-recommended, (3) half of the processes become non-recommended, and (4) only one process remains recommended.
Using the received information, recommended processes update the DGRP membership.
The Dynamic Group of Recommended Processes - DGRP is defined as follows: If process i∈ DGRP then ∀j∈ DGRP |j tested i, i passed the test, i.e., i is tested as recommended by all recommended processes.
As processes arrive at a barrier, they check the DGRP composition in order to reassign tasks among recommended processes.
