search for: parall

I was thinking about [Bug 3099]... in that while it's easy to get a 2-3x speed for the average app using parallel scans, the upper and lower bounds on that speed increase could be <1x in a worst case (very unlikely, but with primitive or constrained (in a container or VM) HW, the chances are raised. Better, with less std. deviation, I believe, might be to move I/O calls to all being AIO -- It seems tha...

This is a great wine from L'Empurd?, Spain. If you want to know more information contact: Direction: C/ Garriguella 8 Town: Mollet de Peralada Comarca: Alt Empord? CP: 17752 Tel?fon: 972634320 It's the best wine I've ever seen.

On Nov 3, 2008, at 3:55 PM, heisenbug wrote: > What about "inventing" pseudo-constants (which point to the right > thing) and build the piece of IR with them. When done, grab mutex and > RAUW it in. Alternatively, submit to a privileged thread that performs > the RAUW. > The trick is to prepare the def/use chain(s) to a degree that the > mutex is only held a minimal

...wrote: > > I am interested in making my LLVM front-end multi-threaded in a way > > similar to the GCC compiler server proposal and was wondering about > > the > > extent that the LLVM passes support it. > > Do you have a link for this? I'm not familiar with any parallelism > proposed by that project. My understanding was that it was mostly > about sharing across invocations of the compiler. Nope, you're right. I'm not sure where I got that idea, but I certainly don't see it in their whitepaper. > Are you talking about building your A...

I''m trying to index ~130,000 documents [soon to grow to about 500,000 documents] and I''m wondering if its possible to combine ferret databases or in some other way split up the building process. Normally, indexing 130k documents wouldn''t be that painful except that there are different types of links between these documents and they are not absolute (so for example

...e: > > > I am interested in making my LLVM front-end multi-threaded in a way > > similar to the GCC compiler server proposal and was wondering about   > > the > > extent that the LLVM passes support it. > > Do you have a link for this?  I'm not familiar with any parallelism   > proposed by that project.  My understanding was that it was mostly   > about sharing across invocations of the compiler. > > > Expression-at-a-time parallel construction: > > If function definitions are built purely depth-first, such that the > > parent pointers...

Dear All, I work for the small IT company and I would like to ask the question concerning the project that I work on-Namely is it posible to run multiple instances of Samba and LDAP paralely on the one server --For example one cental server for Samba and LDAP and one instance running for each separate client -and if it possible the suggestion how to best accomplish that ... I thank you in

...2:20 PM, Jonathan Brandmeyer wrote: > I am interested in making my LLVM front-end multi-threaded in a way > similar to the GCC compiler server proposal and was wondering about > the > extent that the LLVM passes support it. Do you have a link for this? I'm not familiar with any parallelism proposed by that project. My understanding was that it was mostly about sharing across invocations of the compiler. > Expression-at-a-time parallel construction: > If function definitions are built purely depth-first, such that the > parent pointers are not provided as they are...

I am interested in making my LLVM front-end multi-threaded in a way similar to the GCC compiler server proposal and was wondering about the extent that the LLVM passes support it. Expression-at-a-time parallel construction: If function definitions are built purely depth-first, such that the parent pointers are not provided as they are created, what will break? I noted that the function and module verifiers aren't complaining, at least not yet. Is there a generic "fixup upward-pointing parent...

Is there a way to speed up rsync by opening more than one daemon in parallel. I use rsync --daemon to start rsync. I was wondering if opening more than one instance is recommended or feasible? I know that for services like nfs for example I have had opening many instances improve performance. I have 4 cores available so if there are any other parallization modes I'd...

Dear all, I've found a bug report for R when installing it on an AIX5.1 system. There's a followup (number 4) that comments a segmentation fault on R when quitting "q()". I'm using a newer version of R but on the same operating system and I obtain the same error. There was a way to solve this problem? Best regards and thanks, --

...swap at 1:1, 0:1 and 1/2:1 to see if there is any benefit and to what degree. My first assumption is that it would depend on exactly what I am doing in R and that fact would need to be taken into account to the observations and testing I am doing. To be clear, I've not approached writing any parallized code other than what R might do out of the box. However, what testing I have done (using a standard deviation test as well as a GBM model) seems to indicate that the Windows desktop (with small/slow swap footprint) as well as a Solaris 11 X86 server with swap set to half of physical memory seem...

On 7/17/13 12:35 PM, Diego Novillo wrote: > On Fri, Jul 12, 2013 at 3:49 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > >> 3. How to parallelize post-IPO stage >> ==================================== >> >> From 5k' high, the concept is very simple, just to >> step 1).divide the merged IR into small pieces, >> step 2).and compile each of this pieces independendly. >> step 3) the obj...

...le result=0; int i; for (i=0; i<N; i++) { result += i*3; data[i] = result; } func1(data, data1); printf(" Data[10] = %lf\n", data[10]); printf("Data1[10] = %lf\n", data1[10]); return 0; } =============================================== I got following parallalization info after compiling: Loop main:for.body has a loop carried scalar dependence, hence will not be parallelized Loop func:for.body carries no dependence, hence is being parallelized Since A and B to function "func" are aliases it shouldn't have parallelized. Can you...

...actually thwarted your experiment by performing inlining just before link-time. You can disable this in ~/aesop/blank/Makefile. It does this unconditionally as a standard set of pre passes to help the analysis as much as possible. As a result, AESOP knows that A and B do not alias and is correctly parallelizing here. Best, Tim On Mar 11, 2013, at 8:59 AM, Rahul wrote: > Hi Timothy, > > Today I happened to download the code and do some experiments. > I actually wanted to see how you handle inter-procedure alias analysis. > So, I set inline threshold to zero and tried out followi...

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 call...

On Wed, Jul 17, 2013 at 1:06 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > > On 7/17/13 12:35 PM, Diego Novillo wrote: >> >> On Fri, Jul 12, 2013 at 3:49 PM, Shuxin Yang <shuxin.llvm at gmail.com> >> wrote: >> >>> 3. How to parallelize post-IPO stage >>> ==================================== >>> >>> From 5k' high, the concept is very simple, just to >>> step 1).divide the merged IR into small pieces, >>> step 2).and compile each of this pieces independendly. >>...

Hi, I am trying to parallize the lli interpreter (code: http://pastebin.com/6iuHNH3Q). I am using ubuntu 12.04 with llvm version 3.1. Each thread uses a seperate LLVMContext, however the interpreter continues to crash. $ clang -S -emit-llvm test.c && parallel_lli test.s Error msg: ..../include/llvm/Support/Mutex.h:...

Dear expeRts, is it possible to carry out calculations between different foreach() calls? As for nested loops, you want to carry out calcuations not depending on the inner loop only once and not for each iteration of the innermost loop. Cheers, Marius library(foreach) foreach(i=1:3) %:% foreach(j=1:2) %do% { i <- i+1 print(paste(i,j)) } foreach(i=1:3) %:% i

Dear all I have the following code that works in paraller (and is pretty fast actually) The only problem I still have is that every core just prints only once. dimz<-1000 Shadowlist<-mclapply(1:dimz, function(i) { ????????????????????????????? print(sprintf('Creating the %d map',i)); ????????????????????????????? createField(x=x, y=y, m...