search for: mve

...ans paste with the explorer seems to be working fine. I have no idea which reason this can have. Maybe some pro here outside has an idea. Of course there can be recognized something in the /var/log/messages: ------------------------------------------------------------------------ Mar 7 11:14:47 mve-server2 smbd[8195]: [2006/03/07 11:14:47, 0] lib/util_sock.c:write_data(554) Mar 7 11:14:47 mve-server2 smbd[8195]: write_data: write failure in writing to client 0.0.0.0. Error Connection reset by peer Mar 7 11:14:47 mve-server2 smbd[8195]: [2006/03/07 11:14:47, 0] lib/util_sock.c:send_smb(...

Dear R users, I am trying to use MCD and MVE methods in the analysis of functional imaging (fMRI) data. But, before doing that, I want to understand the sampling distribution of the correlation parameter given by MCD and MVE (cov.mcd$cor, cov.mve$cor). To this end, I conducted a simulation where in each of 100000 epochs, I a. construct a...

Dear R users, I am trying to use MCD and MVE methods in the analysis of functional imaging (fMRI) data. But, before doing that, I want to understand the sampling distribution of the correlation parameter given by MCD and MVE (cov.mcd$cor, cov.mve$cor). To this end, I conducted a simulation where in each of 100000 epochs, I a. construct a...

Hi all I have a couple of obscure questions for R/Splus experts (which unfortunately isn't me!) I am trying to compute Bayes Factors using some Splus code of Raftery in Gilks et al (1996). Only problem is 1) R doesn't seem to have a robust covariance (cov.mve) which I suspect I need rather than a non-robust classical estimate 2) Splus has cov.mve BUT dgamma in Splus doesn't have a scale parameter (like in R). I presume it is easy to include one but it is not immediately obvious to me. I would prefer to use R and could probably modify minvol.f to c...

Dear All, The Minimum Volume Ellipsoid estimator ("cov.mve") was part of S+ but I cannot find it in R. Where can I find it? Why was it excluded? Cheers, Patrik Sweden

Is there public domain code for cov.mve? Thanks, -k =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- r-devel mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-devel-req...

On 11/6/20 12:39 PM, Sjoerd Meijer wrote: Hello Simon, Thanks for your replies, very useful. And yes, thanks for the example and making the target differences clear: ; Some examples: ; RISC-V V & VE(*): ; %mask = (splat i1 1) ; %evl = min(256, %n - %i) ; MVE/SVE : ; %mask = get.active.lane.mask(%i, %n) ; %evl = call @llvm.vscale() ; AVX: ; %mask = icmp (%i + (seq <8 x i32> 0,1,2,.,)), %n, ; %evl = i32 8 Unless I miss something, the AVX example is semantically the same as get.active.lane.mask: %m[i] = icmp ult (%base + i), %n...

Does anyone know a good open source and free webmonitoring software which I can use to monitor some websites and build simple uptime/downtine statistics for my customers (conform SLA's) ? Any help/hitns would be very apperciated :) -- Michiel

...o emit VPred for the widening. VPred IR needs two additional operands, as you mentioned, %evl and %mask. One option is make %evl the max-vector-length of the type being operated and %mask (that is the "outer block mask" in this context) be get.active.lane.mask. This maps well for SVE and MVE not so much for VE and RISC-V (I don't think it is incorrect but it is not an efficient thing to do). Perhaps VE and RISC-V can work in this scenario if at some point they replace the %evl with something like "%n - %base" operands of get.active.lane.mask, and %mask (the outer block m...

; RISC-V V & VE(*): ; %mask = get.active.lane.mask(%i, %i) ; %evl = min(256, %n - %i) ; MVE/SVE/AVX : ; %mask = get.active.lane.mask(%i, %n) ; %evl = call @llvm.vscale() For VE, we want to do as much predication as possible through %evl and as little as possible with %mask. This has performance implications on VE and RISC-V - VE does not generate a mask from %evl but %evl is direc...

Hello Simon, Thanks for your replies, very useful. And yes, thanks for the example and making the target differences clear: ; Some examples: ; RISC-V V & VE(*): ; %mask = (splat i1 1) ; %evl = min(256, %n - %i) ; MVE/SVE : ; %mask = get.active.lane.mask(%i, %n) ; %evl = call @llvm.vscale() ; AVX: ; %mask = icmp (%i + (seq <8 x i32> 0,1,2,.,)), %n, ; %evl = i32 8 Unless I miss something, the AVX example is semantically the same as get.active.lane.mask: %m[i] = icmp ult (%base + i), %n...

...d naturally keep it in place. 2) The whole proposed set of intrinsics is vendor specific: this causes fragmentation and i don't see why we would want to emit vendor-specific intrinsics in a generic optimization pass. Soon, we would see reports a la "your optimization caused regressions for MVE - add a check that the transformation must not touch llvm.set.loop.* or llvm.active.mask intrinsics when compiling for MVE..". I doubt that you would tolerate when that intrinsic were some removed in performance-critical code that would then remain scalar as a result.. so, i do not see the &qu...

Hello llvm-devs, I'm currently starting to look at implementing compiler intrinsics for the Arm MVE vector instruction set. In a similar sort of style to the existing NEON intrinsics, this is going to involve describing the set of functions needed in Tablegen, and then processing that data into a header file and some bits and pieces to compile into clang (the list of builtins, data tables needed...

...lt;Sjoerd.Meijer at arm.com> Cc: Eli Friedman <efriedma at quicinc.com>; llvm-dev <llvm-dev at lists.llvm.org>; Sam Parker <Sam.Parker at arm.com> Subject: Re: [llvm-dev] LV: predication Hi Sjoerd, That would be an excellent way of doing it and it would also map very well to MVE too, where we have a VCTP intrinsic/instruction that creates the mask/predicate (Vector Create Tail-Predicate). So I will go for this approach. Such an intrinsic was actually also proposed in Sam's original RFC (see https://lists.llvm.org/pipermail/llvm-dev/2019-May/132512.html), but we hadn...

...ort key made from two integer columns */ MDPC = (MD * 100000) + PCO; /* sort the dataset by the key */ PROC SORT; BY MDPC; /* print out count and sum for each unique sort key (subgroup) */ /* use of BY MDPC requires sorting that data set by MDPC first in SAS */ PROC UNIVARIATE NOPRINT; VAR MVE; BY MDPC; OUTPUT OUT=TMP0 N=XN SUM=XSUM; Easy to do in R but the problem is the data set this is being run on has 1,742,201 lines in it and takes up 196,868,713 bytes to store as character data. The sort key has easily has over 200,000 unique keys (if not twice that). My first R at...

For RISC-V V and VE being explicit about %evl is important for performance & correctness and that is what VP does. The get.active.lane.mask intrinsic is used as a hint for the MVE, SVE backends to use hardware tail-predication (the backends reverse engineer that hint by pattern matching for get.active.lane.mask in the mask parameter of "some" masked intrinsics). IMHO, it's more of a hot fix to get some tail-predication working quickly with the existing infrastr...

...d naturally keep it in place. 2) The whole proposed set of intrinsics is vendor specific: this causes fragmentation and i don't see why we would want to emit vendor-specific intrinsics in a generic optimization pass. Soon, we would see reports a la "your optimization caused regressions for MVE - add a check that the transformation must not touch llvm.set.loop.* or llvm.active.mask intrinsics when compiling for MVE..". I doubt that you would tolerate when that intrinsic were some removed in performance-critical code that would then remain scalar as a result.. so, i do not see the &qu...

Hello, We are working on predication for our vector extension (MVE). Since quite a few people are working on predication and different forms of it (e.g. SVE, RISC-V, NEC), I thought I would share what we would like to add to the loop vectoriser. Hopefully it's just a minor one and not intrusive, but could be interesting and useful for others, and feedback on t...

Hi, Arm have recently announced the v8.1-M architecture specification for our next generation microcontrollers. The architecture includes vector extensions (MVE) and support for low-overhead branches (LoB), which can be thought of a style of hardware loop. Hardware loops aren't new to LLVM, other backends (at least Hexagon and PPC that I know of) also include support. These implementations insert the loop controlling instructions at the MachineInstr le...

...ile[1] ## LTS results with robust residuals NameC_lts <- lqs(gpanew~female+female:lastinit+agenew+canadian+mom_ed+yearstudy, quantile = quantile[1], psamp = psamp, nsamp = nsamp) rr <- residuals(NameC_lts)/NameC_lts$scale[2] rr_nok <- abs(rr) > critval[1] ## robust leverage via MCD (or MVE) X <- model.matrix(NameC)[,-1] cv <- cov.rob(X, method = method, quantile = quantile[2], nsamp = dist_nsamp) rd <- sqrt(mahalanobis(X, cv$center, cv$cov)) rd_nok <- rd > critval[2] ## ROBUST results nok <- rr_nok & rd_nok NameC_rob <- lm(formula, data[!nok,]) rval <- lis...