----Efficient Time and Volume DNA Simulation of CREW PRAM Algorithms

We present, in this paper, a detailed translation from algorithms implemented on a standard model of parallel computation — the CREW PRAM — to DNA-based methods. Our translation is efficient in the following sense: if A is a PRAM algorithm using P (n) processors, S (n) space, and taking T (n) time then the total volume of DNA used is O ( P (n) T (n) S (n) logS (n) ); furthermore, the total computation time of the DNA algorithm is bounded by O ( T (n) logS (n) ). As a consequence our methods give a direct translation from any NC algorithm into an effective DNA algorithm.