search for: autoparallel

Hi Timothy, > 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 dependence analysis and parallel code generation using calls to POSIX threads. Si...

On 03/03/2013 02:09 PM, Timothy Mattausch Creech wrote: > 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 dependence analysis and parallel code generation using calls to POSIX threads....

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 dependence analysis and parallel code generation using calls to POSIX threads. Since we currently hav...

...From: "Timothy Mattausch Creech" <tcreech at umd.edu> > To: "Sebastian Dreßler" <dressler at zib.de> > Cc: "Aparna Kotha" <akotha at umd.edu>, llvmdev at cs.uiuc.edu > Sent: Sunday, March 3, 2013 11:32:49 AM > Subject: Re: [LLVMdev] AESOP autoparallelizing compiler > > Hi Sebastian, > Sure! The bulk of LMDA was written by Aparna Kotha (CCd). It > computes dependences between all instructions, computes the > resulting direction vectors in the function, then associates them > all with loops. > > At a high level, t...

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

On Mon, Mar 04, 2013 at 03:01:15PM +0800, 陳韋任 (Wei-Ren Chen) wrote: > Hi Timothy, > > > 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 dependence analysis and parallel code generation using calls...

..., Mar 04, 2013 at 03:01:15PM +0800, 陳韋任 (Wei-Ren Chen) wrote: > > Hi Timothy, > > > > > 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 > dependence analysis and parallel...

...gt; On Mon, Mar 04, 2013 at 03:01:15PM +0800, 陳韋任 (Wei-Ren Chen) wrote: > > Hi Timothy, > > > > > 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 dependence analysis and parallel code gener...

Hi Sebastian, Sure! The bulk of LMDA was written by Aparna Kotha (CCd). It computes dependences between all instructions, computes the resulting direction vectors in the function, then associates them all with loops. At a high level, the dependence analysis consults with AliasAnalysis, and ScalarEvolution before resorting to attempting to understand the effective affine expressions and

...2->S1 , RAW - S3->S2 C1 (false) : WAW - S3->S1 So then it seems to me that building the dependence graph is essential. Are there no other Analysis/Transforms which require this type of information? I looked at AESOP (http://aesop.ece.umd.edu/doc/aesop-white-paper.pdf) which implements an autoparallelization framework and it seems they would need to do similar checks, the page hosting the code is currently offline. Thanks, Snehasish On Fri, Dec 27, 2013 at 12:24 PM, Preston Briggs <preston.briggs at gmail.com>wrote: > Hi, > > There's no implementation yet of the dependence...

...alues? Dump shows uses=1, and cgn->getNumReferences() shows uses=0; We are writing a Module pass as you can see in the previous code. We have this pass registered as: char PARALLWARE::ID = 0; static RegisterPass<PARALLWARE> X( "parallware","run Parallware source to source autoparallel compiler"); Is this a bug or we are making a mistake? Thank you for your time. Best regards -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121128/a7e7ab6b/attachment.html>

...alues? Dump shows uses=1, and cgn->getNumReferences() shows uses=0; We are writing a Module pass as you can see in the previous code. We have this pass registered as: char PARALLWARE::ID = 0; static RegisterPass<PARALLWARE> X( "parallware","run Parallware source to source autoparallel compiler"); Is this a bug or we are making a mistake? Thank you for your time. We wait for your reply. Please, contact us at this e-mail: eugenio.novas at udc.es. Best regards. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/piperm...

...gorithms. If you believe you are a good match for this position, please e-mail me a brief summary of your qualifications and I will send you a link to interview for the job online. Thanks,~ Will William Norman Braswell, Jr. CEO & President; Auto-Parallel Technologies, Inc. william.braswell at autoparallel.com 512.563.7984 This email message is for the sole use of the intended ...{{dropped:8}}

Hello, I had earlier mailed the list[1] about adding OpenMP support to Clang and LLVM Polly. The LLVM Polly wiki page earlier mentioned a design[2] where Clang and LLVM Polly would emit annotations to the code and there would be a seperate pass that would transform the code using these annotations. The issue I see with this approach is that this pass will have to be run immediately after the

Hi I want to analyse the memory dependencies which exist in a loop at an intra iteration as well as inter iteration (loop carried dependencies). I looked at the DependenceAnalysis implementation which returns a lot of the information I require (based on a prior AliasAnalysis pass), however I need to pass the Src and Dst instructions in program order. I was wondering how I can collect all the

...o say a Polly integration is a big piece to >> swallow.Your pro-Polly argument lists a number of categories that >> I think could be reasoned about individually and partly evaluated >> with a data-driven approach: >> A) Architecture >> - support for autoparallelism >> - support for accelerators >> - isl- rewrite? etc >> ... >> B) Modelling >> - polyhedral model >> - temporal locality >> - spatial locality >> … >> C) Analysis/Optimizations >> - Dependence Ana...

...*) above). But I think it is objective > to say a Polly integration is a big piece to swallow.Your pro-Polly > argument lists a number of categories that I think could be reasoned about > individually and partly evaluated with a data-driven approach: > A) Architecture > - support for autoparallelism > - support for accelerators > - isl- rewrite? etc > ... > B) Modelling > - polyhedral model > - temporal locality > - spatial locality > … > C) Analysis/Optimizations > - Dependence Analysis > - Transformation effective/power (loop nests, quality of transformati...

...nk it is objective >> to say a Polly integration is a big piece to swallow.Your pro-Polly >> argument lists a number of categories that I think could be reasoned about >> individually and partly evaluated with a data-driven approach: >> A) Architecture >> - support for autoparallelism >> - support for accelerators >> - isl- rewrite? etc >> ... >> B) Modelling >> - polyhedral model >> - temporal locality >> - spatial locality >> … >> C) Analysis/Optimizations >> - Dependence Analysis >> - Transformation effectiv...

...gt;> piece to swallow.Your pro-Polly argument lists a number of >>> categories that I think could be reasoned about individually >>> and partly evaluated with a data-driven approach: >>> A) Architecture >>> - support for autoparallelism >>> - support for accelerators >>> - isl- rewrite? etc >>> ... >>> B) Modelling >>> - polyhedral model >>> - temporal locality >>> - spatial locality >>> … >...

...(for disclosure mine is (*) above). But I think it is objective to say a Polly integration is a big piece to swallow.Your pro-Polly argument lists a number of categories that I think could be reasoned about individually and partly evaluated with a data-driven approach: A) Architecture - support for autoparallelism - support for accelerators - isl- rewrite? etc ... B) Modelling - polyhedral model - temporal locality - spatial locality … C) Analysis/Optimizations - Dependence Analysis - Transformation effective/power (loop nests, quality of transformations, #vectorizable loops etc) A) is mostly Polly inde...