similar to: [LLVMdev] Questions on Parallelism and Data Dependence Analysis

Hi, Thanks for your advice. I have tried this way: opt -mem2reg test.bc -o mem2reg.bc llvm-dis mem2reg.bc opt -functionattrs -basicaa -aa-eval -print-all-alias-modref-info mem2reg.bc The content of main() in mem2reg.ll: define i32 @main() nounwind { entry: %"alloca point" = bitcast i32 0 to i32 ; <i32> [#uses=0] %0 = call %struct.Location* @getNewLocation(i32 0, i32

On Mon, Jun 29, 2009 at 7:40 PM, Wenzhi Tao<linus_wind at zju.edu.cn> wrote: >   The result of -aa-eval: > >  MayAlias:     %struct.Location* %0, %struct.Location* %1 >  MayAlias:     %struct.Location* %0, %struct.Location* %2 >  MayAlias:     %struct.Location* %1, %struct.Location* %2 I'm getting NoAlias with the given steps; are you using trunk LLVM? -Eli

> Hi, I have two questions about llvm, and expect your reply very much. > > 1. Is there any plan of llvm to support Thread-Level Parallelism by using > OpenMP, MPI, pthread or llvm-defined directives? > If automatic parallelism exploring is very hard, what is the key > problem? We can't get the precise data dependence > information at compile-time? llvm-gcc uses

On 04/20/2011 08:05 AM, Andreas Wilhelm wrote: > Am 19.04.2011 um 16:44 schrieb John Criswell: > >> On 4/19/11 5:57 AM, Andreas Wilhelm wrote: >>> Hello, >>> >>> I found some code within the pool allocation project to identify >>> parallelizable function calls. >>> Unfortunately the functionality isn't part of the current release of

Hello, I found some code within the pool allocation project to identify parallelizable function calls. Unfortunately the functionality isn't part of the current release of poolalloc (in release 14 it was). My intention is to estimate the parallelization-potential of sequential applications concerning coarse-grained parallelism. Can you tell me... 1. Why are classes of pollalloc, like

Am 22.04.2011 um 18:03 schrieb Tobias Grosser: > On 04/20/2011 08:05 AM, Andreas Wilhelm wrote: >> Am 19.04.2011 um 16:44 schrieb John Criswell: >> >>> On 4/19/11 5:57 AM, Andreas Wilhelm wrote: >>>> Hello, >>>> >>>> I found some code within the pool allocation project to identify >>>> parallelizable function calls.

Am 19.04.2011 um 16:44 schrieb John Criswell: > On 4/19/11 5:57 AM, Andreas Wilhelm wrote: >> >> Hello, >> >> I found some code within the pool allocation project to identify parallelizable function calls. >> Unfortunately the functionality isn't part of the current release of poolalloc (in release 14 it was). > > Can you tell me in what file(s) this

On 4/19/11 5:57 AM, Andreas Wilhelm wrote: > Hello, > > I found some code within the pool allocation project to identify > parallelizable function calls. > Unfortunately the functionality isn't part of the current release of > poolalloc (in release 14 it was). Can you tell me in what file(s) this is implemented? I wasn't aware that the poolalloc project had such an

On 2009-06-29 11:16, Wenzhi Tao wrote: > Hi, all > > According to the document "LLVM Alias Analysis Infrastructure", I > evaluated the AA performance by using the paramenters '-basicaa -ds-aa > -anders-aa'. The source code 'test.c' is listed as follow: > [...] > The whole process: > > llvm-gcc -emit-llvm -O0 -c test.c -o test.bc > > opt

Hi all, I apologize to not keep you up to date to what is going on with my project. Portavales has worked in a desk behind me and when we go to take coffee we talk about the project. Second I didn't know we have to discuss weekly, it was my fault. I should have read the rules. Sorry. At the first month, I studied the code and the Theora Beta implementation. The code is completely different

Hi Wenzhi, This question would be best answered on the samba list ( I am cc'ing a copy now ) Its not a binary dependant question, otherwise I would have answered it promptly. Sorry for brushing you off, I just dont have the time to help you. I am sure someone on the samba list will be more than happy to lend you a hand. Brian Roberson brian@bstc.net -----Original Message----- From:

Hi, I'm working on an application that compiles using LLVM from multiple threads. Currently, I'm doing this using one ExecutionEngine, but I've observed that this does not seem to scale well past a couple cores. I'd like to be able to get as much parallelism as possible in the compilation, and was wondering about using one ExecutionEngine per thread. The only information

On Apr 2, 2008, at 1:14 AM, Pertti Kellomäki wrote: > I am pretty excited about the recent activity on dependence > analysis. The only remaining problem from our point of view > is how to get the alias information to the back end instruction > scheduler. If I understand things correctly, the alias information > basically gets lost in the process of lowering to target >

Is is possible since LLVM 2.7 to create multiple ExecutionEngine in the same process. Olivier. On Thu, Oct 7, 2010 at 6:41 PM, George Brewster <g at brewster.org> wrote: > Hi, > I'm working on an application that compiles using LLVM from multiple > threads. Currently, I'm doing this using one ExecutionEngine, but I've > observed that this does not seem to scale

I am pretty excited about the recent activity on dependence analysis. The only remaining problem from our point of view is how to get the alias information to the back end instruction scheduler. If I understand things correctly, the alias information basically gets lost in the process of lowering to target instructions. We are interested in the DSP domain, so we really need to get SIMD style

Greetings. In looking through the mail archives, I don't see any mention of parallelism of the vorbis code (particularly the encoder). I was wondering if anyone was looking into this at all? Either with threads, and/or on some kind of parallel machine (e.g., a Beowulf cluster)? I see very little mention of threads in the source code, which leads me to believe that they are only there for

Hi I just read the thread on gotoBLAS, as well as the excellent vignette of gcbd. I still have some confusion and would like to ask very basic questions, hope I am not taking too much of your time. The point that retained my attention was the question of using implicit (multi-threaded blas) versus explicit (parallel code) optimisation. As I understood, the ideal would be to use a

Hi, all According to the document "LLVM Alias Analysis Infrastructure", I evaluated the AA performance by using the paramenters '-basicaa -ds-aa -anders-aa'. The source code 'test.c' is listed as follow: //------------=== Source code ===------------// #include<stdlib.h> typedef struct { int x; int y; } Location; Location* getNewLocation(int x, int y) {

Hi, I am trying to use F test or Chi-square test to test if 2 5-parameter (A, B, xmid, scal and H) logistic curves are parallel based on residual sum of squares. What's usually done is to first fit the 2 curves using a constraint (or global) model where all parameters are kept the same except for "xmid"; then fit 2 independent curves using unconstraint models where all 5 parameters

if i have a single oss with multiple ost''s do i get any parallelism when striping across the ost''s? i.e. would a client form multiple connections on whatever transport between the itself the oss?