This paper presents a parallel version of a Generalized Conjugate Gradient algorithm proposed by Liu and Story in which the search direction considers the effect of the inexact line search. We describe the implementation of this algorithm on a parallel architecture and analyze the related speedup ratios. Numerical results are given for a shared memory computer (Cray C92).