# The programs written on these machines are, in general, of type [[SIMD]].
These kinds of algorithms are useful for understanding the exploitation of concurrency, dividing the original problem into similar sub-problems and solving them in parallel. The introduction of the formal 'P-RAM' model in Wyllie's 1979 thesis<ref>Wyllie, James C. (1979). The Complexity of Parallel Computations, PhD Thesis, Dept. of Computer Science, Cornell University<ahref="http://hdl.handle.net/1813/7502"ref>TR79-387</ had the aim of quantifying analysis of parallel algorithms in a> way analagous to the [[Turing Machine]]. The analysis focused on a MIMD model of programming using a CREW model but showed that many variants, Cornellincluding Universityimplementing a CRCW model and implementing on an SIMD machine, were possible with only constant overhead.
</ref> had the aim of quantifying analysis of parallel algorithms in a way analagous to the [[Turing Machine]]. The analysis focused on a MIMD model of programming using a CREW model but showed that many variants, including implementing a CRCW model and implementing on an SIMD machine, were possible with only constant overhead.
