search for: optimzed

I am trying to optimize a nested function using nlminb. This throws out an error that y is missing. Can someone help me with the correct syntax?? Thank you. test1 <- function(x,y) { sum <- x + y return(sum) } test2 <- function(x,y) { sum <- test1(x,y) sumSq <- sum*sum return(sumSq) } nlminb(start = c(1,1), test2,lower = c(0,0), upper = c(5,5)) -- View this message in

Dear Community, I have a problem I am trying to code in R. Suppose there are 7 products and each have a ROI value attached to it. There are 400 representatives who calls 150,000 customers with these product detailing and achieve sales through the calls. There is a cost per call and revenue earned from the call. Constraint is revenue should be greater than the cost. Now there can be at most 7

It would help if you post the -O0 and -O1bitcode files. Does it reproduce with opt -O1? If so, use -debug-pass= to figure out when things started going wrong. Does it make sense to compare the bitcode against code generated for x86 target? Evan On Aug 16, 2009, at 11:46 AM, Jim Grosbach wrote: > All, > > The following relatively simple function is behaving oddly under SJLJ >

All, The following relatively simple function is behaving oddly under SJLJ exception handling. Specifically, it's being diagnosed by the optimizer as being a nounwind function, which is obviously incorrect. From what I can tell so far, something is going wrong analyzing the call to __cxa_end_catch() invoke arm_apcscc void @__cxa_end_catch() to label %Unwind unwind label

Is there any way to find if a optimization pass has passed in opt? In clang -fsave-optimzization-record would tell if particular optimization pass has applied or failed. Is there similar functionality in opt? Regards, Nethish. -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hello All, I recently installed CentOS 5 and was trying to locate the kernel-smp packages but without success. Have these packages been removed from the distro or renamed? Does anyone know how many processors the default kernel will handle and if it's optimzed for it? Thanks, james

I've done quite a bit of looking, but I haven't found an answer that answers this question. Environment: cygwin on Windows rsync 3.0.4 I know that rsync isn't optimzed for speed on local copies - that's clear in my testing. I'm attemting to sync a large volume of files. (In this case, I'm syncing a rdiff-backup set...) An initial sync will be about one fourth as fast a a cp of the same files. "Ok, that's not a huge deal. Subsequent syncs sh...

Hi, I found that after moving to Clang pre-3.6 (git 65d8b4c4998b3a0c20934ea72ede72ef4838a004) and trunk (git 718825a8666acd9ceaab70fc7868332f20e2758f) our internal build machines started going offline in Jenkins. Clang after 3.5 release is consuming extreme amounts of memory in some cases. I have uploaded [1] one of affected files. $ g++ -std=c++11 -c -O1 -fPIC vpp_generated.ii -o

Dear all, I am doing few experiments to do understand optimization phase interactions. Here is a brief description of my experiements. 1. I picked the list of machine independent optimizations acting on llvm IR (those that are enabled at O3). 2. for each optimzation in the optimization-list a) Compiled the program using 'clang -c O0 -flto program.c' b) opt

...orAdd_kernel.ptx is then translated to vectorAdd_kernel.bin file using JIT. Nvidia uses JIT to get benefit in-case when next-generation GPUs are encounterd. 2. OpenCL compilation on AMD GPUs a. vectorAdd_kernel.cl is first translated to LLVM IR using gcc/clang b. LLVM IR is then converted into optimzed LLVM IR using LLVM optimizer. c. optimized LLVM IR is then converted into AMD IL. d. AMD IL is then converted into AMD ISA using shader compiler (GPU JIT). I understand that AMD uses back-end compilation as part of JIT, instead Nvidia which uses back-end separate from JIT. Is that correct? If...

Hi folks. My first post over here. While working on a music server optimzation (which ususally goes hand in hand with running pretty low buffers on realtime streams) I figured that certain HiRez flacs were causing XRUNS/hickups on my Linux server platform. The interesting thing is to run into XRUNS even though the stream gets send to a Squeezebox Touch which got a 20s buffer on its receiving

Hi, Is it me or is CentOS 5 faster than FC6? I just switched and it seems that CentOS 5 loads faster and overall feels snappier. Could Red Hat have optimzed EL more than Fedora?. Just curious. I really like what I see with CentOS 5. The devs have done a great job making a profesisonal looking distro. An of course kudos to Red Hat for all the engineering and for making the SRPMS available. Paul

I have an optimization question that I was hoping to get some suggestions on how best to go about sovling it. I would think there is probably a package that addresses this problem. This is an ordering optimzation problem. Best to describe it with a simple example. Say I have 100 "bins" each with a ball in it numbered from 1 to 100. Each bin can only hold one ball. This optimization is

Hello, I'm developing a programming language that is optimized for strings. A first hello world program shows me that llvm needs a lot more work on zero terminated strings. In the following example, I have an auto generated hello world example optimized with -O3. The problem is, that the constant string is copied into a malloced mem area, then puts is called and then the memory is freed.

...e no choice > without making 'for' in the assembly. Maybe you can look, how code operates on phi-nodes in C & MSIL backends. > 1) First, I tried to re-unite basic blocks which llvm-gcc spits out to make 'for' again. > But this is quite tricky. Generalizing it for the optimzed llvm bytecode is not easy. I'd say 'is not possible at all'. In general, loop contain induction variable, which is being assigned each iteration of loop. As LLVM IR is in SSA mode, there are only two possibilities to operate on induction variable so: 1. Use phi node 2. Use memory (mem...

Hi All: A couple of weeks back, I asked a question on the list that I was invited to provide an introductory lecture on R to a group of academicians in Kolkata. I thank all of you who had generously guided me in providing me web links and words to the wise. Time to give back. I did the presentation on introduction to R and uploaded the presentation files at the following site:

Extend the virtio balloon device to support a new feature, this new feature can help to get guest's free pages information, which can be used for live migration optimzation. Signed-off-by: Liang Li <liang.z.li at intel.com> --- balloon.c | 30 ++++++++- hw/virtio/virtio-balloon.c | 81 ++++++++++++++++++++++++-

I was wondering about what the near and longer term future directions for optimization of Vorbis decompression are. I am interested in using it as a replacement for MP3. But it seems at this point (not certain about this) that Vorbis doesn't really have much optimization implemented yet. By this I mean, for example, implementing something like MMX x86 optimzations in order to speed up the

R fails to build with visibility on and gcc 4.9's link time optimzation, because of its practice of building part of it as archive first. Specifically it builds some bundled libraries as archive first, the symbols of which are then entirely invisible in gcc 4.9. The Matrix package also does this awful practice, with CHOLMOD.a COLAMD.a AMD.a SuiteSparse_config.a . One way of fixing R is:

The following C code : #include <stdio.h> #include <stdlib.h> int TESTE2( int parami , int paraml ,double paramd ) { int varx=0,vary; int nI =0; //varx= parami; if( parami > 0 ) { varx = parami; vary = varx + 1; } else { varx = vary + 1; vary = paraml; } varx = varx + parami + paraml; for( nI = 1 ; nI <= paraml; nI++) { varx =