Effective results on a fixed point algorithm for families of nonlinear mappings

We use proof mining techniques to obtain a uniform rate of asymptotic regularity for the instance of the parallel algorithm used by L\'opez-Acedo and Xu to find common fixed points of finite families of $k$-strict pseudocontractive self-mappings of convex subsets of Hilbert spaces. We show that these results are guaranteed by a number of logical metatheorems for classical and semi-intuitionistic systems.