January 31, 2007 harangue by Dave Patterson for a Stanford University Computer Systems Colloquium (EE 380). A different organisation of UC Berkeley researchers from most backgrounds – circuit design, mechanism architecture, massively together computing, computer-aided design, embedded hardware as well as software, programming languages, compilers, systematic programming, as well as numerical research – met for scarcely dual years to plead correspondence from these most angles. EE 380 | Computer Systems Colloquium: www.stanford.edu Stanford Computer Systems Laboratory: csl.stanford.edu Stanford Center for Professional Development: scpd.stanford.edu Stanford University Channel upon YouTube: www.youtube.com
I think using parallel computing is more about choosing the right algorithms and datastructures, we can do that with many existing languages.
My comment keeps being censored off here. The gist of it is that, it’d work to use thread-scheduling types of algorithms to split up non-parallel programs and run them in parallel environments (whether that’s clusters, multicores, multiple processers).
Come up with an abstract works-for-anything outline. Kind of a mix of pipelining and job scheduling. Yes? No? Why no if so?
Yeah, good video, the things that bother me are the hand waving at the end about how to bridge traditional clunky apps to this new model, i’m not so sure the traditional poorly written software is going to simply disappear anytime in the next 15 years
So I think the work is good, ideas are good for the most part, but its going to be up to “industry” to figure out how to actually bridge between old and new if research don’t want to tackle that problem because its too hard.
so interesting lesson
Excellent lecture
Excellent view of the past and how and why the present and the future exists the way it does (and will).
It is almost like the hardware gals/guys pushes the promise (problem) of Moores law to the software gals/guys.