Phd thesis on parallel computing

If parallel programming is to become as widespread as sequential programming, the languages supporting it should incorporate all the standard abstraction mechanisms including higher order functions, recursion, pattern matching, etc.. Yet for such languages to be practical scalable programming tools, abstraction should not come at the price of predictable performance. Unfortunately many parallel languages don't describe data placement so that performance is not predictable as a function of the source program. This is because data placement depends on the language implementation, not its semantics.

Phd thesis on parallel computing

phd thesis on parallel computing

Media:

phd thesis on parallel computingphd thesis on parallel computingphd thesis on parallel computingphd thesis on parallel computing