search for: arrayprivatization

...s. At a high level, the dependence analysis consults with AliasAnalysis, and ScalarEvolution before resorting to attempting to understand the effective affine expressions and performing dependence tests (e.g., Banerjee). If it cannot rule out a dependence, then it will additionally consult with an ArrayPrivatization analysis to see if an involved memory object can be made thread private. It is probably also worth mentioning that the LMDA has been written not only to function well with IR from source code, but also with low level IR from a binary to IR translator in a separate project. This has required new tec...

...the dependence analysis consults with AliasAnalysis, > and ScalarEvolution before resorting to attempting to understand the > effective affine expressions and performing dependence tests (e.g., > Banerjee). If it cannot rule out a dependence, then it will > additionally consult with an ArrayPrivatization analysis to see if > an involved memory object can be made thread private. It is probably > also worth mentioning that the LMDA has been written not only to > function well with IR from source code, but also with low level IR > from a binary to IR translator in a separate project. This...

Hi, On 03/03/2013 07:09 AM, Timothy Mattausch Creech wrote: > [...] > The main components of the released implementation are loop memory > dependence analysis and parallel code generation using calls to POSIX > threads. The loop memory dependence analysis sounds very interesting to me. Could you provide some more information regarding its capabilities? Cheers, Sebastian -- Mit

Hi, We would like to inform the community that we're releasing a version of our research compiler, "AESOP", developed at UMD using LLVM. AESOP is a distance-vector-based autoparallelizing compiler for shared-memory machines. The source code and some further information is available at http://aesop.ece.umd.edu The main components of the released implementation are loop memory