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

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? 2. Can I use the functions provided by llvm to

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.

Many of you probably remember the flurry of posts that I created a few weeks ago about writing a parallel vorbis encoder. Here's what I have been doing since... Someone (I can't remember who offhand -- might have been Greg) mentioned using threads instead of MPI for parallelism on the argument that more people have SMPs than who have (and know how to use) an MPI implementation. Good

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

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

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

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

Shows that as the MCU increases, the OpenMP extra overhead is amortized and OpenMP becomes as fast as the pthreads implementation. The last chart http://lampiao.lsc.ic.unicamp.br/~piga/gsoc_2008/systime.png Shows that both pthreads and OpenMP overhead decreases as what seems to be a logarithmic function of the MCU size. This was a great experiment, and from what I can conclude, the OpenMP

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

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:

On Thursday 12 July 2007 13:08, Chandler Carruth wrote: > > > Right. For example, the Cray X1 has a much richer set of memory > > > ordering instructions than anything on the commodity micros: > > > > > > http://tinyurl.com/3agjjn > > > > > > The memory ordering intrinsics in the current llvm proposal can't take > > > advantage

On 15 August 2012 11:04, Raghavendra, Prakash <Prakash.Raghavendra at amd.com> wrote: > My idea is to capture parallelism with the way you have said using > ‘metadata’. I agree to record the parallel regions in the metadata (as given by the user). However, we > could also give placeholders to record any additional information that the compiler writer needs like > number of

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

Mingxing, Your project sounds interesting and if it significantly improves over the live variable analysis that is in LLVM right now, I think it could be a useful contribution. I'm copying the 'llvmdev at cs.uiuc.edu' mailing list, which you should join. Send all related messages to this list to get feedback on your goals and also to get help with any problems you face.

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

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, I have searched and not found waht tls versions are supported with samba 4.4.5 as AD. IS tls 1.2 supported with samba 4.4? If not what version? Thanks

Hello, everyone! Recently, I build llvm project for Visual Studio 2008 using cmake successfulley. I modify the project LLVMHello of the entire solution to generate LLVMHello.dll instead of LLVMHello.lib without other changes. Then, the flowing commands is executed: opt -load LLVMHello.dll --help But, I can't find the information string for hello pass. opt -load LLVMHello.dll

Since neither anaconda nor system-config-kickstart can give a list of all packages that has been installed, waht is the recommended way to replicate one system for another new installation (without using hd cloning) ? Is it possible to simply do 'rpm -qa >> my-ks.cfg' ? When running anaconda installer, it gives system selection as well as package grouping (desktop vs server ->