We describe how a recently published algorithm - which addresses the sign problem within the context of the Green's function Monte Carlo method - can be implemented in a parallel distributed environment. The method of parallelization maintains large granularity and therefore large overhead. Despite the stochastic nature of the algorithm, good load-balancing can be accomplished and reproducibility is ensured.