search for: 40x

...\005\215\225??n????\205?\205?'?\220??,e#?\2150\025K\em?\022Wn\177[@?\fQ?4w3g?yX???\024\b\2222????F[p??n??r?(??\017?\214\177\220;qI?Z,.Bv\026$R?", siglen=128, rsa=0x198b700) at bsd/tools/openssl/crypto/rsa/rsa_sign.c:147 147 if (siglen != (unsigned int)RSA_size(rsa)) (gdb) x/40x 0x198b7a0: 0x00000041 0x00000000 0x00008000 0x00000000 0x198b7b0: 0x00000000 0x00000000 0x00000000 0x00008000 0x198b7c0: 0xe5b83d65 0x00000001 0x5555686d 0x61632d6d 0x198b7d0: 0x64352d39 0x36005555 0x00000000 0x00000000...

...ange, only the "Intel lga1366 i7 980XE" (from the list of what our suppliers stock) have VT-d, and it costs 4x more than "Intel lga1366 i7 930" or 2x more than "Intel lga1366 i7 960". From a budget perspecitve I could purchase 4 more CPU's, which could translate to 40x - 80x more VM's being hosted for the same capital outlay. Experience has shown that we under-utilize CPU's by a great margin and memory / HDD IO is our biggest bottleneck on any server. So, if VT-d really necessary? We mainly host XEN virtual machine for the hosting industry, i.e. we don...

...The above code is the entirety of the implementation for decoding and > processing '.relrz.dyn' sections in glibc dynamic loader. > > This encoding can represent up to 56 relocation offsets in a single 64-bit > word. For many of the binaries we tested, this encoding provides >40x > compression for storing offsets over the original `.relr.dyn` section. > > For 32-bit targets, we use 32-bit entries: 8-bits for 'jump' and 24-bits for > the bitmap. Very nice! Simple and effective. > Here are three real world examples that demonstrate the savings: Impre...

...aisy-chained to the rear backplane (both expanders). Each of the two expander chains is connected to one port of an LSI SAS 9200-8e HBA. So far, all this hardware has appeared as working for others and well-supported, and this 9200-8e is running the -IT firmware, version 15.0.0.0. The drives are 40x of the WD4001FYYG SAS 4TB variety, firmware VR02. The spot-checks I''ve done so far seem to show that both device instances of a drive show up in "prtconf -Dv" with identical serial numbers and identical "devid" and "guid" values, so I''m not sure what...

...I SAS 9201-16e HBA''s (Dell resold[1]). > > Sounds similar in approach to the Aberdeen product another sender referred to, > with SAS switch layout: > http://www.aberdeeninc.com/images/1-up-petarack2.jpg > > One concern I had is that I compared our SuperMicro JBOD with 40x 4TB drives > in it, connected via a dual-port LSI SAS 9200-8e HBA, to the same pool layout > on a 40-slot server with 40x SATA drives in it. But the server uses n > expanders, instead using SAS-to-SATA octopus cables to connect the drives > directly to three internal SAS HBA'...

...potential for speedup. On my system, 'N=200000; x <- substring(paste(rep("A", N), collapse=""), 1:N, 1:N)' spends 96% time in checking if the string is ascii and 3% in strlen(); if we take advantage of the pre-computed value in the ASCII bit, the speed up is about 40x. Of course, with micro-benchmarks, any performance limitation can be arbitrarily inflated, users cannot expect to see these or any close speedups in applications as a result of the patch. The patch is going to do other easy optimizations that will not complicate the code, including avoiding the...

...ystem, > > 'N=200000; x <- substring(paste(rep("A", N), collapse=""), 1:N, 1:N)' > > spends 96% time in checking if the string is ascii and 3% in strlen(); > if we take advantage of the pre-computed value in the ASCII bit, the > speed up is about 40x. The latest version of pqR (at pqR-project.org) has changes that considerably speed up both this and other string operations. Here's a test (both compiled with gcc 8.2.0 with -O3 on a Skylake processor). R-3.5.2: > N=200000; system.time(for (i in 1:100) r<-paste(rep("A",N),...

...ckage, however it's running incredibly slow (20,000 predictions takes ~45 seconds on win64 R distribution). CPU is running at 25% and RAM utilization is a mere 17% ... it's not a hardware bottleneck. Similar calculations using data mining algorithms in SQL Server analysis services run about 40x faster. Through trial and error, we discovered that the laplacedot kernel gives us the best results by a wide margin. Rbfdot is about 15% less accurate, but twice as fast (but still too slow). The best performance is vanilladot. It runs more or less instantly but the accuracy is way too low to u...

...reader, first time poster :) I seem to be having a problem with my samba server. When doing file work, it likes to suddenly reboot... Let me rattle off hardware specs here: AMD k6-2 300, 128mb PC-100 mem, 3gb WD and 10gb WD, a 3c905b and two Netgear 310FX's, a Diamond Stealth, and a Memorex 40x cdrom. I am actually planning on taking out the second netgear card (or maybe the 3c905b). This box runs RedHat 6.1 with these services: samba, nfs, httpd(apache), bind, and dhcpd. The 10 gb hard drive has a 7gig partition setup for mp3's. I noticed that every once in a while, when listenin...

...ss. How can I programatically handle 404s and 500s when using Mongrel? I''ve read about using a proxy server config (.htaccess for example) to render an ErrorDocument rather than whatever comes from Rails, but I need something different. I would like to send an email on 500 errors, and log 40x errors. It would be nice to do this within my app code. I ask here simply because everything I''ve found has dealt with either plain html pages or FCGI. Thanks in advance! -- Cheers, Kevin "Any sufficiently advanced technology is indistinguishable from Magic." - Arthur C. Cl...

+llvm-dev Discussion here: https://sourceware.org/ml/gnu-gabi/2017-q2/msg00000.html On Tue, May 2, 2017 at 10:17 AM, Suprateeka R Hegde <hegdesmailbox at gmail.com> wrote: > On 02-May-2017 12:05 AM, Florian Weimer wrote: >> On 05/01/2017 08:28 PM, Suprateeka R Hegde wrote: >>> So the ratio shows ~96% is RELATIVE reloc. And only ~4% others. This is >>> not the

...faces. * LLVM now supports llvm.stacksave/llvm.stackrestore intrinsics, for proper C99 Variable Length Array support. * Nate reimplemented post-dominator analysis using the Lengauer and Tarjan algorithm, replacing the old iterative implementation. On one extreme example his implementation is 40x faster than the old one (PR681) and uses far less memory. * Daniel Berlin contributed an ET-Forest implementation, which replaces the old LLVM DominatorSet with a far more efficient data structure (in both space and time). * Andrew wrote a new "reg2mem" which transforms an LLVM func...

...to LLVM (about ~1.1M LOC, or clang's ~900KLOC) what we're really discussing is whether it is better to favor the core preferences of the lld authors vs the opportunity cost of developers jumping from llvm/clang and being effective in the lld code base. Given that we're talking about a 40x size difference, along with greater unity in the llvm community, this seems like a simple decision to me. I see your point and can concede that not everyone in the C++ community follows the same approach as the LLVM coding standards, but a) the greater C++ community is far from unified on the lld...

Please take a look: http://llvm.org/docs/ReleaseNotes.html -Chris -- http://nondot.org/sabre/ http://llvm.org/

...subsequent entry. The above code is the entirety of the implementation for decoding and processing '.relrz.dyn' sections in glibc dynamic loader. This encoding can represent up to 56 relocation offsets in a single 64-bit word. For many of the binaries we tested, this encoding provides >40x compression for storing offsets over the original `.relr.dyn` section. For 32-bit targets, we use 32-bit entries: 8-bits for 'jump' and 24-bits for the bitmap. Here are three real world examples that demonstrate the savings: 1) Chrome browser (x86_64, built as PIE): File size (stripp...

On Mon, Oct 6, 2014 at 5:00 PM, Nick Kledzik <kledzik at apple.com> wrote: > On Oct 6, 2014, at 3:44 PM, Rui Ueyama <ruiu at google.com> wrote: > > Looks like most people in this thread support using LLVM style in LLD. I > also had an offline discussion and many people wanted to have one coding > style in all LLVM projects. So I'm convinced that we should do that.

...hether computed bits are demanded or not, based on Nate's design and implementation in the code generator. * Nate reimplemented post-dominator analysis using the Lengauer and Tarjan algorithm, replacing the old iterative implementation. On one extreme example his implementation is 40x faster than the old one (PR681) and uses far less memory. * Daniel Berlin contributed an ET-Forest implementation, which replaces the old LLVM DominatorSet with a far more efficient data structure (in both space and time). * Andrew wrote a new "reg2mem" which transforms an L...

I just used a Live CD for the first time today, in part to show what CentOS can do for a co-worker who is looking at using it at work and home, but I got the strangest result. We booted the CD and let the centos user log in. It took a really long time to load the desktop and there were no panels, so the only things we could do were browse the computer, CD, home, file system, keyboard (sort of)

Hi all, (and especially hi to Tomas Kalibera who accepted my patch sent yesterday) I believe that I have found another bug, this time in the substring function. The use case that I am concerned with is when there is a single (character scalar) text/subject, and many substrings to extract. For example substring("AAAA", 1:4, 1:4) or more generally, N=1000

...sign and implementation in the code generator. Try to reword and get rid of one "based on". > * Nate reimplemented post-dominator analysis using the Lengauer and > Tarjan algorithm, replacing the old iterative implementation. On one > extreme example his implementation is 40x faster than the old one > (PR681) and uses far less memory. > * Daniel Berlin contributed an ET-Forest implementation, which > replaces the old LLVM DominatorSet with a far more efficient data > structure (in both space and time). > * Andrew wrote a new "reg2mem" wh...