Implementing (Nondeterministic) Parallel Assignments

We present an algorithm that implements a parallel assignment as an optimal sequence of single assignments on a serial computer. The algorithm is optimal in the sense that it generates the minimum number of single assignments. Further, if the CPU is capable of executing multiple instruction threads, the algorithm can generate the minimal sequence that takes advantage of them.