We show thatrpseudo-random bits can be obtained by concatenatingtblocks ofr/tpseudo-random bits, where the blocks are generated in parallel. This can be considered as a parallel version of [8]—recycling random bits by doing a random walk on an expander. The proof is based on the fact thattsimultaneous independent random walks on an expander graph is equivalent to a random walk on a much larger expander. In [8] generating the random walk requires arithmetic operation with long integers. In the parallel version the integers involved are much shorter, and different segments of the pseudo-random bits are generated independently in parallel. Optimal speedup is also achieved.