search for: fasterize

On 16 November 2016 at 15:52, Rafael Espíndola <rafael.espindola at gmail.com> wrote: > I will do a quick benchmark run. On a mac pro (running linux) the results I got with all cores available: firefox master 7.146418217 patch 5.304271767 1.34729488437x faster firefox-gc master 7.316743822 patch 5.46436812 1.33899174824x faster chromium master 4.265597914 patch

SHA1 in LLVM is *very* naive, any improvement is welcome there! It think Amaury pointed it originally and he had an alternative implementation IIRC. — Mehdi > On Nov 16, 2016, at 3:58 PM, Rui Ueyama via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > By the way, while running benchmark, I found that our SHA1 function seems much slower than the one in gold. gold slowed down by

The current implementation was “copy/pasted” from somewhere (it was explicitly public domain). > On Nov 16, 2016, at 4:05 PM, Rui Ueyama <ruiu at google.com> wrote: > > Can we just copy-and-paste optimized code from somewhere? > > On Wed, Nov 16, 2016 at 4:03 PM, Mehdi Amini <mehdi.amini at apple.com <mailto:mehdi.amini at apple.com>> wrote: > SHA1 in LLVM is

Hi Steven- Nice, but will this not break Windows? From an initial glance over your patch, it seems to assume the existence of mmap() in some form or other. Alistair On 8 Aug 2010, at 03:05, Steven Noonan wrote: > Hi folks, > > I've been doing work on memory reduction in Unladen Swallow, and > during testing, LiveRanges seemed to be consuming one of the largest > chunks of

Hi folks, I've been doing work on memory reduction in Unladen Swallow, and during testing, LiveRanges seemed to be consuming one of the largest chunks of memory. I wrote a replacement allocator for use by BumpPtrAllocator which uses mmap()/munmap() in place of malloc()/free(). It has worked flawlessly in testing, and reduces memory usage quite nicely in Unladen Swallow. The code is available

Even with Spork, my requests specs are very slow to start running (about 7 seconds). I suspect Rails is booting each time I run "rspec -X spec/requests". Is that true? If so, is there any way I could instruct the web server to keep alive after the specs run so that it would be faster on next run? Are there any resources on how to have better performance on running requests specs

Hi, I want to compile a mathematical expression. So shall be faster. It should be as fast as it would be hard coded. With the parser i use it is too slow. Do you know how i can compile in time, so an expression is evaluated faster ? I develop for iphone! Thanks a lot ! Chris -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi guys, I am still learning R, and not well familiar with all the apply functions. I am trying to find faster alternatives to replace the for cycle. Is there a faster way to do the example below? nm <- 1000 b <- matrix (rnorm (5000, 0, 1), nrow = 500, ncol = nm) a <- matrix (0, nm, nm) for (i in 1 : nm) { for (j in 1 : nm) { if ( j == i) { next } a[i, j] <- t (b [, i]) %*% b[, j] } }

Hey, Can anyone answer this question. I am working with really large datasets and most of the programs I have been running take quite some time. I heard that R may be faster in Unix. I sthis true and if so can anyone reccomend which system and requirements may allow things to go faster for? Thanks!! Elizabeth Lawson --------------------------------- [[alternative

useR's, I am trying trying to find out if there is a faster way to do a certain computation. I have successfully used FOR loops and the apply function to do this, but it can take some time to fully compute, but I was wondering if anyone may know of a different function or way to do this: > x [1] 1 2 3 4 5 > xk [1] 0.0 0.5 1.0 1.5 2.0 2.5 3.0 3.5 4.0 4.5 5.0 5.5 6.0 I want to do:

LLD supports multi-threading, and it seems to be working well as you can see in a recent result <http://llvm.org/viewvc/llvm-project?view=revision&revision=287140>. In short, LLD runs 30% faster with --threads option and more than 50% faster if you are using --build-id (your mileage may vary depending on your computer). However, I don't think most users even don't know about that

I need to move data from one zpool to another, lock stock and barrel, Being from linux background my instinct was to use rsync. But then I remembered seeing the `export/import options in man zpool.. And I''ve seen mention of them here too, but didn''t pay attention since I''d noticed no need yet. Now I''m wondering if the export/import sub commands might not be

I have heard that there are some .dll files in wine that are faster than the ones in windows, i have a dual booting vista and ubuntu system, and i have a server that i'm looking to turn into a gaming pc, but i'm not going to buy another copy of windows, so i have installed ubuntu onto it, and am going to import the .dll files from windows, each and every one of them, but since there are

El 03/05/12 12:19, Miroslav Lichvar escribi?: > It makes the C function faster than the corresponding asm routine, so > if it's included I'd suggest to just drop the asm function to not keep > around more asm code than is necessary. With current compilers it is very likely that those routines are already superflous.

On Nov 19, 2009, at 2:10 PM, Jon Harrop wrote: > On Thursday 19 November 2009 19:48:18 Owen Anderson wrote: >> On Nov 19, 2009, at 10:25 AM, Jon Harrop wrote: >>>> In this case, the assertion that LLVM is slow is correct: it's >>>> definitely slower than a non-optimizing compiler. >>> >>> I'm *very* surprised by this and will test it

Maybe this is a silly question, but i have a few million files i need to delete but i can't just reformat the volume. Right now the fastest thing i can think of is nice -20 rm -Rf /folder-i-want-to-delete is there a better or faster way to do this? Thanks, Jamie

Hi All. In my C++ code I'm using the libc++ library and my question is about which construct is faster: for(auto line : lines) { ... } or for(auto it = lines.begin(); it != lines.end(); it++) { … } Thanks in advance for any answer. Luca.

Hello, I am just curious...which is faster? Obviously if the machines are the same size and all conditions are equal except for the OS. Regards, Jake Johnson jake@plutoid.com ______________________________________________________________________ Plutoid - http://www.plutoid.com - Shop Plutoid for the best prices on Rims, Car Audio, and Performance Parts.

Hello, does anybody know another faster function for random multivariate normal variable simulation? I'm using mvrnorm, but as profiling shows, my algorithm spends approximately 50 % in executing mvrnorm function. Maybe some of you knows much faster function for multivariate normal simulation? I would be very gratefull for advices. -- View this message in context:

On Nov 19, 2009, at 1:04 PM, Bob Wilson wrote: >> I've tested it and LLVM is indeed 2x slower to compile, although it >> generates >> code that is 2x faster to run... >> >>> Compared to a compiler in the same category as PCC, whose pinnacle of >>> optimization is doing register allocation? I'm not surprised at all. >> >> What else