The algorithm is described in the diploma thesis of Michael Brickenstein
"Neue Varianten zur Berechnung von Groebnerbasen",
written 2004 under supervision of G.-M. Greuel in Kaiserslautern.
It is designed to keep polynomials slim (short with small coefficients).
Currently best results are examples over function field (parameters).
For the performance it is essential, that one of following is fullfilled: the ideal is homogeneous or the ordering is a degree ordering, maybe future version will improve here.
The program only supports the option prot (which will give protocoll output).
The Protocoll looks like that:
M[n,m] means a parallel reduction of n elements with m non zero output elements.
"b" notices an exchange trick described in the thesis and "e" adds reductor with non minimal leading term.
For an example see slim Groebner bases.