search for: ple

...xt-in-line CPU' is scheduled out? As >> in the hypervisor knows - but you as a guest might have no idea >> of it. > > I use a heart-beat counter to see if the other side responses within a > certain time limit. If not, I assume it has been scheduled out probably > due to PLE. PLE is unnecessary if you have "true" pv spinlocks where the next-in-line schedules itself out with a hypercall (Xen) or hlt instruction (KVM). Set a bit in the qspinlock before going to sleep, and the lock owner will know that it needs to kick the next-in-line. I think there is no...

...xt-in-line CPU' is scheduled out? As >> in the hypervisor knows - but you as a guest might have no idea >> of it. > > I use a heart-beat counter to see if the other side responses within a > certain time limit. If not, I assume it has been scheduled out probably > due to PLE. PLE is unnecessary if you have "true" pv spinlocks where the next-in-line schedules itself out with a hypercall (Xen) or hlt instruction (KVM). Set a bit in the qspinlock before going to sleep, and the lock owner will know that it needs to kick the next-in-line. I think there is no...

I have download bryce 7 PLE from http://www.daz3d.com/i/software/bryce7/download?_m=d installed it (must remove Z: drive as the installer trys copy files outside of drive_C) entering your name and serial code is impossible as you cant type any thing, luckly I had a copy of windows installed and was able copy the .Bryce70.dta...

...cheduled out? As >>> in the hypervisor knows - but you as a guest might have no idea >>> of it. >> >> I use a heart-beat counter to see if the other side responses within a >> certain time limit. If not, I assume it has been scheduled out probably >> due to PLE. > > PLE is unnecessary if you have "true" pv spinlocks where the > next-in-line schedules itself out with a hypercall (Xen) or hlt > instruction (KVM). Set a bit in the qspinlock before going to sleep, > and the lock owner will know that it needs to kick the next-in-li...

...lock needs to touch a second cacheline; add a pending > bit and allow a single in-word spinner before we punt to the second > cacheline. I think there is an unwanted scenario on virtual machines: 1) VCPU sets the pending bit and start spinning. 2) Pending VCPU gets descheduled. - we have PLE and lock holder isn't running [1] - the hypervisor randomly preempts us 3) Lock holder unlocks while pending VCPU is waiting in queue. 4) Subsequent lockers will see free lock with set pending bit and will loop in trylock's 'for (;;)' - the worst-case is lock starving [2]...

...lock needs to touch a second cacheline; add a pending > bit and allow a single in-word spinner before we punt to the second > cacheline. I think there is an unwanted scenario on virtual machines: 1) VCPU sets the pending bit and start spinning. 2) Pending VCPU gets descheduled. - we have PLE and lock holder isn't running [1] - the hypervisor randomly preempts us 3) Lock holder unlocks while pending VCPU is waiting in queue. 4) Subsequent lockers will see free lock with set pending bit and will loop in trylock's 'for (;;)' - the worst-case is lock starving [2]...

...* 7) PlayDontPlay=DontPlay 3 0 sunny (0.0000000 0.0000000 1.0000000) * Andy _____ From: r-help-bounces at stat.math.ethz.ch on behalf of Alan Lapedes Sent: Sun 4/16/2006 5:14 PM To: r-help at stat.math.ethz.ch Subject: [R] Problem getting R's decision tree for Quinlan's golf example data [Broadcast] Newbie question, but I've checked archives etc. Am trying to reproduce in R Quinlan's trivial example of the "golf" decision tree. The data file of 14 examples follows (read in via read.table()): Outlook Temperature Humidity Windy PlayDontPlay 1 sunny 85 8...

>openssl version Libressl 2.4.4 Patch for dovecot: perl -i -ple 's/^(#if OPENSSL_VERSION_NUMBER < 0x10100000L\s*)$/$1 || defined (LIBRESSL_VERSION_NUMBER)/' ./src/lib-dcrypt/dcrypt-openssl.c; perl -i -ple 's/^(#if OPENSSL_VERSION_NUMBER < 0x10100000L\s*)$/$1 || defined (LIBRESSL_VERSION_NUMBER)/' ./src/lib-ssl-iostream/dovecot-openssl-comm...

...d here are halted -- they're either >> running or runnable (descheduled by the hypervisor). > > /me actually looks at Waiman's code... > > Right, this is really different from pvticketlocks, where the *unlock* > primitive wakes up a sleeping VCPU. It is more similar to PLE > (pause-loop exiting). Adding to the discussion, I see there are two possibilities here, considering that in undercommit cases we should not exceed HEAD_SPIN_THRESHOLD, 1. the looping vcpu in pv_head_spin_check() should do halt() considering that we have done enough spinning (more than typica...

...d here are halted -- they're either >> running or runnable (descheduled by the hypervisor). > > /me actually looks at Waiman's code... > > Right, this is really different from pvticketlocks, where the *unlock* > primitive wakes up a sleeping VCPU. It is more similar to PLE > (pause-loop exiting). Adding to the discussion, I see there are two possibilities here, considering that in undercommit cases we should not exceed HEAD_SPIN_THRESHOLD, 1. the looping vcpu in pv_head_spin_check() should do halt() considering that we have done enough spinning (more than typica...

Hello Everyone... I work as a sys admin for a small college in North West PA. Recently, a group on campus has stareted an animation club, and are looking into purchasing MAYA for linux.... very expensive. I thought I might be able to help them out and set up MAYA PLE through wine... I get WINE setup and can run IE6, however when i run the maye.exe installer, the installer launches, hangs, then eventually crashes... Not sure where to really go from here... Any advice or suggestions would be greatly appreciated... wine "c:\temp\maya.exe" fixme:im...

On 27/02/14 13:11, Paolo Bonzini wrote: > Il 27/02/2014 13:11, David Vrabel ha scritto: >>> > This patch adds para-virtualization support to the queue spinlock code >>> > by enabling the queue head to kick the lock holder CPU, if known, >>> > in when the lock isn't released for a certain amount of time. It >>> > also enables the mutual

On 27/02/14 13:11, Paolo Bonzini wrote: > Il 27/02/2014 13:11, David Vrabel ha scritto: >>> > This patch adds para-virtualization support to the queue spinlock code >>> > by enabling the queue head to kick the lock holder CPU, if known, >>> > in when the lock isn't released for a certain amount of time. It >>> > also enables the mutual

From: Raghavendra K T <raghavendra.kt@linux.vnet.ibm.com> This series replaces the existing paravirtualized spinlock mechanism with a paravirtualized ticketlock mechanism. The series provides implementation for both Xen and KVM. The current set of patches are for Xen/x86 spinlock/KVM guest side, to be included against -tip. A separate patchset for KVM host based on kvm tree is already sent. Results: ======= setup: 32 core machine with 32 vcpu KVM guest (HT off) with 8GB RAM base = 3.11-rc...

From: Raghavendra K T <raghavendra.kt@linux.vnet.ibm.com> This series replaces the existing paravirtualized spinlock mechanism with a paravirtualized ticketlock mechanism. The series provides implementation for both Xen and KVM. The current set of patches are for Xen/x86 spinlock/KVM guest side, to be included against -tip. A separate patchset for KVM host based on kvm tree is already sent. Results: ======= setup: 32 core machine with 32 vcpu KVM guest (HT off) with 8GB RAM base = 3.11-rc...

From: Raghavendra K T <raghavendra.kt@linux.vnet.ibm.com> This series replaces the existing paravirtualized spinlock mechanism with a paravirtualized ticketlock mechanism. The series provides implementation for both Xen and KVM. The current set of patches are for Xen/x86 spinlock/KVM guest side, to be included against -tip. A separate patchset for KVM host based on kvm tree is already sent. Results: ======= setup: 32 core machine with 32 vcpu KVM guest (HT off) with 8GB RAM base = 3.11-rc...

...iable is delay.type, a repeated-measures within-subject variable (2 levels: Synch and Asynch, order counter-balanced across participants). I had a series of covariates that were included in the initial model and used a step-wise process to produce the most parsimonious model (two covariates age and PLE). The final model was: disem<-lmer(comp.score~delay.type+age+PLE+(1|id), data=Disembodiment) The first 5 rows of the data frame appeared as follows: head(Disembodiment) id comp comp.score delay.type sex age yrs.edu PLE fds bds 4 C01 Disembodiment 1.3846685 Synch f 56...

...>: > Hi, wanpeng > > On 2016?07?05? 17:57, Wanpeng Li wrote: >> >> Hi Xinhui, >> 2016-06-28 22:43 GMT+08:00 Pan Xinhui <xinhui.pan at linux.vnet.ibm.com>: >>> >>> This is to fix some lock holder preemption issues. Some other locks >>> implementation do a spin loop before acquiring the lock itself. Currently >>> kernel has an interface of bool vcpu_is_preempted(int cpu). It take the >>> cpu >>> as parameter and return true if the cpu is preempted. Then kernel can >>> break >>> the spin loops...

...>: > Hi, wanpeng > > On 2016?07?05? 17:57, Wanpeng Li wrote: >> >> Hi Xinhui, >> 2016-06-28 22:43 GMT+08:00 Pan Xinhui <xinhui.pan at linux.vnet.ibm.com>: >>> >>> This is to fix some lock holder preemption issues. Some other locks >>> implementation do a spin loop before acquiring the lock itself. Currently >>> kernel has an interface of bool vcpu_is_preempted(int cpu). It take the >>> cpu >>> as parameter and return true if the cpu is preempted. Then kernel can >>> break >>> the spin loops...

...] "t Size: 1916" [1] "------------------------" [1] "file C:/CRUTEM3.nc has 1 variables:" [1] "float temp[longitude,latitude,unspecified,t] Longname:Temperature T Missval:2.00000004008175e+20" > data2=get.var.ncdf(hyo) > write.csv(data2,file="C:/ple.csv") But the problem is, I expected this data would be 17000 * 72 (row* col) ; but, it is the other way around. 72*17000 Because the maximum col number in excel is 16383, this cvs file doesn't show all data. Obviously, I need to transpose the matrix.. I tried to use transpose function...