search for: worstcase

Displaying 5 results from an estimated 5 matches for "worstcase".

Did you mean: worst_case
2011 Jul 26
2
[LLVMdev] XOR Optimization
Hi- > I haven't seen a machine in which OR is faster than ADD nor more energy-efficient. They're all done by the same ALU circuitry which delays the pipeline by its worstcase path timing. So, for modern processor hardware purposes, OR is exactly equal ADD. Transforming ADD to OR isn't strenght reduction at all. Maybe this is benefical only if you have a backend generating circuitry (programming FPGAs). I believe that in cases where ADD and OR are equivalent, LLVM p...
2011 Jul 26
0
[LLVMdev] XOR Optimization
...d more energy-efficient, so it should be preferred when > the compiler > can statically infer that its usage is correct. > I haven't seen a machine in which OR is faster than ADD nor more energy-efficient. They're all done by the same ALU circuitry which delays the pipeline by its worstcase path timing. So, for modern processor hardware purposes, OR is exactly equal ADD. Transforming ADD to OR isn't strenght reduction at all. Maybe this is benefical only if you have a backend generating circuitry (programming FPGAs). > > > - Is there a straight forward way to know if a...
2011 Jul 26
2
[LLVMdev] XOR Optimization
Hi Daniel, > Hi folks, > > I couldn't find a specific XOR (OR and AND) optimization on llvm, and > therefore I am about to implement it. > But first I would like to check with you guys that it really does not exist. > > For a simple loop like this: > > nbits = 128; > bit_addr = 0; > while(nbits--) > { > bindex=bit_addr>>5; /* Index is
2011 Jul 26
0
[LLVMdev] XOR Optimization
...he help guys On Tue, Jul 26, 2011 at 9:55 AM, Alistair Lynn <arplynn at gmail.com> wrote: > Hi- > > > I haven't seen a machine in which OR is faster than ADD nor more > energy-efficient. They're all done by the same ALU circuitry which delays > the pipeline by its worstcase path timing. So, for modern processor hardware > purposes, OR is exactly equal ADD. Transforming ADD to OR isn't strenght > reduction at all. Maybe this is benefical only if you have a backend > generating circuitry (programming FPGAs). > > I believe that in cases where ADD and O...
2001 Dec 13
3
behaviour of ssh/scp over flakey links - timeout/retry?
I'm using OpenSSH's ssh and scp to back up some remote machines, roughly as follows : ssh remote-host "tar up a few dirs" scp remote-host:tarfile local-repository On the whole, as I'd expect, this works just fine. But .. sometimes the link is a bit dodgey (for lack of a more explicit term, this being a polite list :) ) Can anyone tell me how ssh and scp timeout and retry,