While the traditional von-neumann architecture can be considered canonical for single-processor computation, when it comes to parallel computers there is no such canonical model. There are so many way you can design a parallel computer that different classes of algorithms are more optimal than others on any particular one. Here I'm talking in terms of real programs running on real machines instead of theoretical ones. Even so, no matter how clever you get with our without locks (even with hardware assist), you can't get around Amdahl's Law. We, at Aros Magic, have figured out the hitherto intractable problem of decoding media files in parallel and are showcasing it as the [url="http://www.arosmagic.com/Viewer"]world's fastest photo viewer[/url]. If promotion of massivel parallel computation interests you, please support us. Yes, our technology is essentially lock-free [img]http://public.gamedev.net//public/style_emoticons/default/smile.png[/img] .