The BS-Solve implementation of Gröbner bases maintains the iterative structure of the sequential algorithm but parallelizes the loop body in the following sense. Multiple S-polynomials are created in parallel, reduction is then processed by a collective operation before new pairs of polynomials are created in parallel.