search for: redundance

First of all, sorry for the long mail. Inspired by the excellent analysis Rui did for lld, I decided to do the same for llvm. I'm personally very interested in build-time for LTO configuration, with particular attention to the time spent in the optimizer. Rafael did something similar back in March, so this can be considered as an update. This tries to include a more accurate high-level

On Sat, Dec 17, 2016 at 6:39 PM, Mehdi Amini <mehdi.amini at apple.com> wrote: > >> On Dec 17, 2016, at 1:35 PM, Davide Italiano via llvm-dev <llvm-dev at lists.llvm.org> wrote: >> >> First of all, sorry for the long mail. >> Inspired by the excellent analysis Rui did for lld, I decided to do >> the same for llvm. >> I'm personally very

> On Dec 17, 2016, at 1:35 PM, Davide Italiano via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > First of all, sorry for the long mail. > Inspired by the excellent analysis Rui did for lld, I decided to do > the same for llvm. > I'm personally very interested in build-time for LTO configuration, > with particular attention to the time spent in the optimizer. >

> On Dec 17, 2016, at 1:35 PM, Davide Italiano via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > First of all, sorry for the long mail. > Inspired by the excellent analysis Rui did for lld, I decided to do > the same for llvm. > I'm personally very interested in build-time for LTO configuration, > with particular attention to the time spent in the optimizer. >

Hello, My host just had a faulty power supply and therefore, my Asterisk server was down for 7 hours. It was a Sunday so no one was making calls, however if it happened during the week, I'd have problems. I was trying to find a whitepaper or advice on how to set up two Asterisk servers to provide some redundancy. I've been googling "asterisk redundancy" but all I've found

Hi We have started evaluating Glusterfs and I am very impressed with what we have seen and tested. I am hoping someone can point me in the right direction or offer a solution. We have multiple servers which we wish to use for storage. We would like to have a single storage array accessible by client machines on the network. We would like to achieve N+2 redundancy but have the ability to keep

I have a list (length 750), each element containing a vector of unique strings (unique gene ids), with length up to ~40 (median 15). I want to compile a matrix of all possible triplets and their frequency within gene elements. Using combn and a lot of looping, I am accomplishing this but it is VERY slow. I've tried to figure out a way to vectorize this, using "match" and

On 12/17/2016 01:35 PM, Davide Italiano via llvm-dev wrote: > First of all, sorry for the long mail. > Inspired by the excellent analysis Rui did for lld, I decided to do > the same for llvm. > I'm personally very interested in build-time for LTO configuration, > with particular attention to the time spent in the optimizer. > Rafael did something similar back in March, so

On Sat, Dec 17, 2016 at 1:35 PM, Davide Italiano via llvm-dev < llvm-dev at lists.llvm.org> wrote: > First of all, sorry for the long mail. > Inspired by the excellent analysis Rui did for lld, I decided to do > the same for llvm. > I'm personally very interested in build-time for LTO configuration, > with particular attention to the time spent in the optimizer. >

I'm trying to justify a GlusterFS storage system for my technology development group and I want to get some clarification on something that I can't seem to figure out architecture wise... My storage system will be rather large. Significant fraction of a petabyte and will require scaling in size for at least one decade. from what I understand GlusterFS achieves redundancy through

Dear everyone in the Mailing list:   It is easy to get the unique elements in a column. But I would like to get rid of those rows that the elements of this column are redundant. Or sometimes, to have a look at the rows that the elements of this column are redundant is also important. I guess it boils down to throw out the index of the redundant elements.   With millions of rows, how can I

Hi Davide, Thanks for the analysis, it's really interesting! And I'm really glad that we now put more and more attention at the compile time! Just recently I've been looking into historical compile time data as well, and have had similar conclusions. The regressions you've found are probably caused by: 1) r289813 and r289855 - new matchers in InstCombine 2) r286814 and r288024 -

I've been reading that it's possible to set up a system with multiple NIC to provide redundant internet connectivity such that it will switch to a secondary connection if the primary ISP fails. Is it possible in a similar way to setup redundant LAN routing? I read that it is possible to aggregate/bond multiple NIC to stackable switches that support link aggregation and redundancy. But if

I am setting up 2 Vyatta routers that will serve as redundant failover core routers out to the backbone of our ISP. They will be serving for routing between other branches and the ISP and bandwidth management. I am trying to differentiate between the plethora of information about having redundant, automatic failover routers and pretty much decided on VRRP for the IP address failover mechanism. I

Hi All, I'm interested in how people are "clustering" Asterisk, if that's possible, or how you might be achieving a redundant solution. I've a single Asterisk server driving the company. Its well backed-up, and I've a cloned machine that (in theory) with a DNS change could take over operations. However I'd like to achieve something more automated if possible. I

Hi all, I?m trying to send 2 frames per RTP packet. One frame is current frame , the other one is previous frame for redundancy. Can you give some recomendation?for beginning ? Thank you very much? -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.xiph.org/pipermail/speex-dev/attachments/20090118/b05876a8/attachment.htm

Hi Sjoerd, I'm already using RDA in the pass I mentioned and it works great. Thanks Sam! Regarding the root cause, I didn't see anything obviously suboptimal not in the copy coalescing or the register allocation, at least in my previous example. Alternatively we might want to improve what we pass onto RA: i.e. remove the redundant copy earlier. At this point however it doesn't

Hi all, I am trying to come up with an architecture that has some redundancy. The idea is to hook up the two GbE LAN interfaces of a CentOS server to two Gigabit Ethernet switches. In case one switch goes down, there is a redundant path (the server is redundant too). Here is the idea: ----------- | GbE | PCs

On Fri, Sep 11, 2015 at 10:06 AM, Hal Finkel <hfinkel at anl.gov> wrote: > Also, if these redundant expressions involve induction variables, then that's something that the IndVarSimplify is already supposed to do, and if it is missing cases, then we should improve that pass (and, thus, folding what you've done into IndVarSimplify might be the right way to go). Hal, thanks for the

Yep, exactly that. We see quite a lot of them, most of them get cleaned up, but not always... Cheers. ________________________________ From: Roger Ferrer Ibáñez <rofirrim at gmail.com> Sent: 16 March 2020 08:53 To: Sjoerd Meijer <Sjoerd.Meijer at arm.com> Cc: LLVM-Dev <llvm-dev at lists.llvm.org>; Sam Parker <Sam.Parker at arm.com> Subject: Re: [llvm-dev] Redundant copies