search for: parallelizationforllvm

...xams > going on, and will be able to contribute only after the coming Friday. Gents, While you've been fooling around with exams, I have been focused with laser-like intensity, or something... Here are new versions of 4 SIV tests: - the Strong SIV test: https://sites.google.com/site/parallelizationforllvm/strong-siv-test - the Weak-Zero SIV test: https://sites.google.com/site/parallelizationforllvm/weak-zero-siv-test - the Weak-Crossing SIV test: https://sites.google.com/site/parallelizationforllvm/weak-crossing-siv-test - the Exact SIV test: https://sites.google.com/site/paralleli...

Hi all, Sorry for having been quiet for so long, I have my university exams going on, and will be able to contribute only after the coming Friday. Thanks! -- Sanjoy Das http://playingwithpointers.com

...after the coming > > Friday. > > Gents, > > While you've been fooling around with exams, I have been focused with > laser-like intensity, or something... > Here are new versions of 4 SIV tests: > > - the Strong SIV test: > https://sites.google.com/site/parallelizationforllvm/strong-siv-test > - the Weak-Zero SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-zero-siv-test > - the Weak-Crossing SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-crossing-siv-test > - the Exact SIV test: > https://s...

...ntribute only after the coming Friday. > > Gents, > > While you've been fooling around with exams, I have been focused with > laser-like intensity, or something... > Here are new versions of 4 SIV tests: > > * the Strong SIV test: > https://sites.google.com/site/parallelizationforllvm/strong-siv-test > * the Weak-Zero SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-zero-siv-test > * the Weak-Crossing SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-crossing-siv-test > * the Exact SIV test: > https://s...

...he Src and Dst instructions in program order. I was wondering how I can collect all the memory access pairs from the basic blocks within the CFG of the loop body which would allow me to know which pairs are RAW/WAR/WAW. It seems related to the approach outlined here : https://sites.google.com/site/parallelizationforllvm/building-the-dependence-graph Is there any existing implementation I can take a look at? It seems that the only the DependenceAnalysis::depends is only called in the dumpExampleDependence() function (checked using cscope). Is there no other module which uses this class? Thanks, Snehasish --------...

...n for LLVM" [4]. They have a lot of interesting stuff on the website, but I am not sure about the progress. Preston should be able to give details here. Cheers Tobi [1] http://mpc.sourceforge.net/ [2] http://polly.sf.net [3] pluto-compiler.sourceforge.net/ [4] https://sites.google.com/site/parallelizationforllvm/

Hi I wanted to know the status of OpenMP (or in general auto parallelization) support in LLVM. I read some threads discussing about possible effort in that direction in 3.1 onwards, but did not see any further discussion on that. If someone in the list knows the updated info or can point me to any useful info, that would be useful. Thanks Regards Prakash Raghavendra -------------- next part

Hi Sanjoy, Here's a version of Banerjee and Wolfe's Exact SIV test: https://sites.google.com/site/parallelizationforllvm/weak-siv-test It assumes you've already filtered out the easy cases handled by ZIV, strong SIV, etc. I'm not confident about my uses of APInt. If you have any comments, I'd love to hear them. Thanks, Preston On Thu, Apr 12, 2012 at 5:14 AM, Sanjoy Das <sanjoy at playingwithpointe...

...being able to pass > > information back to the frontends about which loops are being > > effectively analyzed, and for loops that are not, why not. > > Absolutely. I've been thinking in terms of passing info back to the > programmer (see > https://sites.google.com/site/parallelizationforllvm/feedback). It's a > very interesting problem and one where I think there are real research > possibilities. Do you think that we should do this by adding metadata, or should we establish some kind of separate feedback channel? Metadata would make it more useful for writing regression tes...

...lude user feedback. This means being able to pass information back > to the frontends about which loops are being effectively analyzed, and > for loops that are not, why not. Absolutely. I've been thinking in terms of passing info back to the programmer (see https://sites.google.com/site/parallelizationforllvm/feedback). It's a very interesting problem and one where I think there are real research possibilities. Preston

Take a look to this page: https://sites.google.com/site/parallelizationforllvm/ On Wed, Aug 7, 2013 at 10:52 PM, Valmico <valmico88 at gmail.com> wrote: > Hello, > > I'm currently trying to develop new LLVM Pass that will generate simple > data dependencies graph. For now I'm trying to get familiar with > DependenceAnalysis. > My general ide...

On Wed, 18 Apr 2012 18:16:47 -0700 Preston Briggs <preston.briggs at gmail.com> wrote: > Hi Sanjoy, > > Here's a version of Banerjee and Wolfe's Exact SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-siv-test > It assumes you've already filtered out the easy cases handled by ZIV, > strong SIV, etc. > > I'm not confident about my uses of APInt. If you have any comments, > I'd love to hear them. Are you worried about properly setting the bit lengths, or about los...

Hi, Here is a preliminary (monolithic) version you can comment on. This is still buggy, however, and I'll be testing for and fixing bugs over the next few days. I've used your version of the strong siv test. Thanks! -- Sanjoy Das. http://playingwithpointers.com -------------- next part -------------- A non-text attachment was scrubbed... Name: patch.diff Type: application/octet-stream

Hello, I'm currently trying to develop new LLVM Pass that will generate simple data dependencies graph. For now I'm trying to get familiar with DependenceAnalysis. My general idea is to traverse each function (runOnFunction) top to bottom Instruction by Instruction, using DA.depends( I, I2, ...) on every Instructions combination in function to check if they are dependent on any

...]. These two could > be extended further with runtime-assisted data analysis, where knowing > actual values of pointers and index ranges you can also make conclusions > about read/write modes with respect to particular code regions, like in [3]. > > [1] https://sites.google.com/site/parallelizationforllvm/ > [2] http://polly.llvm.org/ > [3] http://kernelgen.org > Thank you. At a glance [3] is really helpful, so I'll have a deeper look onto it. I also know [2] but didn't used it yet, but now I'll "have to" ;) Maybe a few sentences regarding the purpose: the goal is t...

...;> > information back to the frontends about which loops are being >> > effectively analyzed, and for loops that are not, why not. >> >> Absolutely. I've been thinking in terms of passing info back to the >> programmer (see >> https://sites.google.com/site/parallelizationforllvm/feedback). It's a >> very interesting problem and one where I think there are real research >> possibilities. > > Do you think that we should do this by adding metadata, or should we > establish some kind of separate feedback channel? Metadata would make > it more useful...

...is - the Polly project [2]. These two could be extended further with runtime-assisted data analysis, where knowing actual values of pointers and index ranges you can also make conclusions about read/write modes with respect to particular code regions, like in [3]. [1] https://sites.google.com/site/parallelizationforllvm/ [2] http://polly.llvm.org/ [3] http://kernelgen.org Hope it helps, - D. 2013/1/9 Sebastian Dreßler <dressler at zib.de> > Hi, > > suppose the following C function declaration: > > void f(int *in, int *out); > > Now further suppose, that _in_ is an array only read...

...be extended further with runtime-assisted data analysis, where knowing > > actual values of pointers and index ranges you can also make conclusions > > about read/write modes with respect to particular code regions, like in > [3]. > > > > [1] https://sites.google.com/site/parallelizationforllvm/ > > [2] http://polly.llvm.org/ > > [3] http://kernelgen.org > > > > Thank you. At a glance [3] is really helpful, so I'll have a deeper look > onto it. I also know [2] but didn't used it yet, but now I'll "have to" ;) > > Maybe a few sentences...

Hi, suppose the following C function declaration: void f(int *in, int *out); Now further suppose, that _in_ is an array only read from and _out_ is an array that is only written to. Based on this, I was wondering whether there is some already existing LLVM pass (or maybe a part of a pass) that detects those "data directions" for pointers. I'm not quite sure whether e.g. Alias

...; >> I was wondering how I can collect all the memory access pairs from the >> basic blocks within the CFG of the loop body which would allow me to know >> which pairs are RAW/WAR/WAW. It seems related to the approach outlined here >> : >> https://sites.google.com/site/parallelizationforllvm/building-the-dependence-graph >> >> Is there any existing implementation I can take a look at? >> It seems that the only the DependenceAnalysis::depends is only called in >> the dumpExampleDependence() function (checked using cscope). Is there no >> other module which...