search for: subp

...ers (200+- channels). Symptoms are that these will appear in the CLI on the virtual Asterisk instance: May 11 11:54:32 asterisk: [May 11 11:54:32] #033[1;31mWARNING#033[0m[8830][C-00000d02]: #033[1;37mtaskprocessor.c#033[0m:#033[1;37m895#033[0m #033[1;37mtaskprocessor_push#033[0m: The 'subp:ast_channel_topic_all-0000064d' task processor queue reached 500 scheduled tasks again. May 11 11:54:32 asterisk: [May 11 11:54:32] #033[1;31mWARNING#033[0m[8830][C-00000d02]: #033[1;37mtaskprocessor.c#033[0m:#033[1;37m895#033[0m #033[1;37mtaskprocessor_push#033[0m: The 'subp:ast_channel_t...

...m3, xmm1 + movaps xmm4, [eax+20] + mulps xmm4, xmm0 + addps xmm2, [ecx+4] + movaps xmm5, [ebx+20] + mulps xmm5, xmm1 + addps xmm4, [ecx+20] + subps xmm2, xmm3 + movups [ecx], xmm2 + subps xmm4, xmm5 + movups [ecx+16], xmm4 + + movss xmm2, [eax+36] + mulss xmm2, xmm0 + movss xmm3, [ebx+36] +...

...me results. [Sep 1 20:36:45] ERROR[10081][C-00007fe5]: frame.c:343 ast_frdup: FRACK!, Failed assertion Excessive refcount 100000 reached on ao2 object 0x20380b0 ( continuously for a while followed by a [Sep 1 20:36:46] WARNING[7761][C-0000770d]: taskprocessor.c:888 taskprocessor_push: The 'subp:PJSIP/sipp-00000020' task processor queue reached 500 scheduled tasks. Then this time Asterisk actually crashed. :( ________________________________ From: asterisk-users-bounces at lists.digium.com <asterisk-users-bounces at lists.digium.com> on behalf of Tony Mountifield <tony at so...

...ite obvious but the answer might be of general interest. If I fit a fixed effect with an added quadratic term and then do it as an orthogonal polynomial using maximum likelihood I get the expected result- they have the same logLik. mod2a<-lme(wthole~nplants+I(nplants^2),data=d3,random=~1|field/subplot,m ethod="ML") mod2b<-lme(wthole~poly(nplants,2),data=d3,random=~1|field/subplot,method ="ML") > anova(mod2a,mod2b) Model df AIC BIC logLik mod2a 1 6 6698.231 6723.869 -3343.116 mod2b 2 6 6698.231 6723.869 -3343.116 However if I fit the t...

On Sat, Jul 7, 2012 at 12:25 AM, Anthony Blake <amb33 at cs.waikato.ac.nz> wrote: > On Fri, Jul 6, 2012 at 6:39 PM, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: >> On Jul 5, 2012, at 9:06 PM, Anthony Blake <amb33 at cs.waikato.ac.nz> wrote: >>> [...] >>> movaps 32(%rdi), %xmm3 >>> movaps 48(%rdi), %xmm2 >>>

On Fri, Jul 6, 2012 at 6:39 PM, Jakob Stoklund Olesen <stoklund at 2pi.dk> wrote: > > On Jul 5, 2012, at 9:06 PM, Anthony Blake <amb33 at cs.waikato.ac.nz> wrote: > >> I've noticed that LLVM tends to generate suboptimal code and spill an >> excessive amount of registers in large functions, such as in those >> that are automatically generated by FFTW. >

Thanks for the feedback. I do agree with having multiple smaller servers. When I was first approached with this task I mentioned as much. However, the current desire is to work with already existing hardware. That is out of my hands at the moment unless it just can't be done. I will explore Freeswitch a bit soon to compare it as well. I am struggling to find what the bottle neck is in

...>> %tmp27 = shufflevector <4 x float> %tmp9, <4 x float> %tmp21, <4 x i32> < i32 0, i32 1, i32 4, i32 5 > ; <<4 x float>> [#uses=1] >> ret <4 x float> %tmp27 >> ; CHECK-LABEL: test14: >> -; CHECK: subps [[X1:%xmm[0-9]+]], [[X2:%xmm[0-9]+]] >> -; CHECK: addps [[X1]], [[X0:%xmm[0-9]+]] >> +; CHECK: addps [[X1:%xmm[0-9]+]], [[X0:%xmm[0-9]+]] >> +; CHECK: subps [[X1]], [[X2:%xmm[0-9]+]] >> ; CHECK: movlhps [[X2]], [[X0]] >> } >> &gt...