In this paper we describe a parallel version of the potential reduction algorithm for MIMD distributed memory machines, in which the computational kernels arising at each step of the algorithm are concurrently performed by using standard parallel software environments. This approach is shown to be very effective, in contrast to what happens in the active set strategies where the linear algebra computational kernels represent a serious drawback to an effective parallel implementation. The computational results show the effectiveness of our approach.