search for: outperforming

Dear all, I ran a small program to test the popen() function call performance on both a VM and a physical machine. The program just does a loop of popen() for 20 times and records the total execution time. The host of the VM has the same hardware configurations as the physical machine. The VM and the physical machine both have 2.6.11 kernel. The 20 popen() loops run for 0.453s on VM 0.690s on

On 2008-01-07, at 05:29, Jon Harrop wrote: > On Monday 07 January 2008 02:32:47 Gordon Henriksen wrote: > >> Everything described in GarbageCollection.html should now be live. >> Phew! >> > > This is wonderful news! Are there any example programs using these > GCs? The division of labor is such that the user program must provide the stack walker (in

ACE issued following PR: http://www.ace.nl/news/aces-cosy-compiler-framework-outperforms-llvm-arm9-processor Weird that they don't give any number and use ARM 9, do they mean cortex-a9 ?

On Tue, Apr 25, 2017 at 12:55 PM, Vedant Kumar via llvm-dev <llvm-dev at lists.llvm.org> wrote: > >> On Apr 24, 2017, at 5:37 PM, Scott Smith via llvm-dev <llvm-dev at lists.llvm.org> wrote: >> >> I've been working on improving the startup performance of lldb, and ran into an issue with llvm::HashString. It works a character at a time, which creates a long

Hi there, We're currently attempting to explain a slowdown of an LVQ-type parallel analysis we're working on. We are benchmarking our analysis running over openMosix against the same running via SNOW for R. Both perform similarly on small datasets, but on large datasets SNOW drastically outperforms openMosix. However, these results are achieve running SNOW on the default RedHat

Hi, all: I want to check small files' property(such as date, path, and so on) frequently. The files are stored in netwrok driver and their sizes vary from 2KB to 5KB. I found that Windows 2K outperform Linux/Samba very much after I campared the bench results. I am very confused about it and who can explain it? The computers' configurations are as follows: 1. PC Client It

Gordon Henriksen wrote: > On 2008-01-07, at 05:29, Jon Harrop wrote: > >> On Monday 07 January 2008 02:32:47 Gordon Henriksen wrote: >> >>> Everything described in GarbageCollection.html should now be live. >>> Phew! >>> >> This is wonderful news! Are there any example programs using these >> GCs? > > The division of labor is

Hi all, This patch adds two new apodization functions that I developed. From my own test results (on quite a diverse dataset) they outperform the current best apodizations by 0.05% - 0.1% (depending on the specifics) on compression. Here's a selection of the test results *Apodization functions* ,Compres, Speed partial_tukey(2) tukey(0.5) , 56.50 , 37.2x partial_tukey(3)

I listened to the Oracle webcast about their new upcoming development tools. They mentioned that their C/C++ compiler "far outperforms all open source alternatives". I asked the question if they have any benchmark URL supporting this statement. They actually answered. They said that they stopped publishing benchmark results. But they said that on Intel platform their compiler

I have developed a compact at the same time high performance library for curve25519/ed25519 and I have placed it in the public domain. It support DH key exchange as well as ed25519 keygen, sign and verify. The implementation is constant-time, supports blinding, bulk-verify and more. The library is available as portable-C as well as ASM for Intel-x64 CPUs. It outperforms curve25519-donna by a

...paper describes how, by designing the context switch as a compiler intrinsic instead of a runtime library function, many existing compiler optimizations can be automatically applied to user-space context switches. The paper shows the results of many benchmarks, all of which show this model heavily outperforming existing models of context switching, in both speed and memory usage. For example, it mentions that the POSIX functions makecontext() and swapcontext() save a structure that’s 936 bytes in size (768 on my machine), but their model generates context switches that save only 8-80 bytes of CPU state, d...

I am planning to build a server based on the SuperMicro X7DBE+-O motherboard. This server will have two dual-core Xeon processors and a 3ware 9550SX raid card. Has anyone built a server based on this motherboard? Are there any issues with the smp/dual-core support in CentOS4 that might cause problems? I appreciate any input. I'm just looking to find out about any possible problems before

Hi, We are considering a transition from OpenVZ to Xen for our web server infrastructure. The primary task performed by the virtual servers is to run a number of Drupal sites with a MySQL backend. The webserver and MySQL servers are on separate virtual hosts. We also have a number of smaller hosts running on the same hardware (a couple of dev-servers, a logging-and-monitoring server, a secondary

On 28-05-13 20:09, Janne Hyv?rinen wrote: > On Windows the 32-bit NASM enabled compiles are always fastest. If you > can run 32-bit code on your Linux box you should compile with assembly > optimizations. That depends on the way you define speed. For decoding this doesn't seem to be true. I reran my tests, it took a little longer because I couldn't believe the results I got.

Vanhorn, Mike wrote: > On 5/17/17, 12:03 PM, "CentOS on behalf of ken" <centos-bounces at centos.org > on behalf of gebser at mousecar.com> wrote: > >>An entire filesystem (~180g) needs to be copied from one local linux >>machine to another. Since both systems are on the same local subnet, >>there's no need for encryption. >> >>I've

The release of a new code generator in Mono 2.2 prompted me to benchmark the performance of various VMs using the SciMark2 benchmark on an 8x 2.1GHz 64-bit Opteron and I have published the results here: http://flyingfrogblog.blogspot.com/2009/01/mono-22.html The LLVM results were generated using llvm-gcc 4.2.1 on the C version of SciMark2 with the following command-line options: llvm-gcc

I'm looking for an optimal approach to access Oracle databases via RWeb applications. I'm new to R but familiar with programming functions and web pages for the S+ Statserver. I'm now going through the motions of migrating S+/Statserver applications to R/RWeb as a feasability exercise. I can access databases using ODBC directly in R or S, and using Statserver, but I have not succeeded

On Jul 27, 2012, at 9:36 AM, Sebastien DELDON-GNB wrote: > ACE issued following PR: > http://www.ace.nl/news/aces-cosy-compiler-framework-outperforms-llvm-arm9-processor > Weird that they don't give any number and use ARM 9, do they mean cortex-a9 ? It's impossible to say. This sort of marketing statement is impossible to refute, because there are no details. Who knows whether

Hi: In my opinion, we should axe all pure asm implementations in src/libFLAC/ia32 and the relevant configure options. Reasons are simple: - modern compilers plus the use of intrisincs make the code as faster as possible, if you need maximum speed I suggest you to build with profiling enabled. ;) - there is no support for x86_64 (that is.. all modern PC ;-) ) or for arm (most modern

Martijn van Beurden wrote: Hi Marijn, Sorry for the lack of response on this. I didn't understand it when it came in and I needed time to properly review it. Sunday morning after a really good night's sleep seems like a good time for that :-). I've currently got this patch in an un-published branch. > This patch adds two new apodization functions that I developed. > From my