similar to: speedup is always 0.99

Hello rsync people Today I was recovering data from a beginning-to-fail external USB hard disk. I started with my usual 'rsync -av --ignore-errors <source> <dest>', and that was fine until it got to the first I/O errors. It paused but continued after the first couple of errors, but then the disk started buzzing and rsync gave error messages for every file (I'm afraid

On a dry run, rsync displays a speedup value calculated from the total size of the source file data and the amount of data sent over the connection, but this value is meaningless and grossly misleading because the file data is not sent over the connection. Example: [matt@mattlaptop2 test]$ rsync -avi -n ~/eclipse/releases/eclipse-SDK-3.3-linux-gtk.tar.gz . sending incremental file list

Just nitpicking: 1) DI(F) should include a component that estimate the epi/prologue cost (frameSetupCost) which InlinedDF does not have 2) The speedup should include callsite cost associated with 'C' (call instr, argument passing): Speedup(F,C) = (DI(F) + CallCost(C) - InlinedDF(F,C))/DI(F). Otherwise the proposal looks reasonable to me. David On Thu, Jul 30, 2015 at 2:25 PM,

Hello, i`m using rsync to sync large virtual machine files from one esx server to another. rsync is running inside the so called "esx console" which is basically a specially crafted linux vm with some restrictions. the speed is "reasonable", but i guess it`s not the optimum - at least i don?t know where the bottleneck is. i`m not using ssh as transport but run rsync in

Hi List, I'm observing a strange problem on 2.6.9 (no opportunity to upgrade on both ends yet). Receiver is linux, sender is cygwin. I transferred a 6GB file (an MS SQL .bak file) physically from one site to the other, in order to get the first "backup" done. In the meantime, the sender generated a new file, which I know for a fact to be very similar to the manually transferred

https://bugzilla.samba.org/show_bug.cgi?id=4764 Summary: Wrong include/exclude descriptions Product: rsync Version: 2.6.8 Platform: Other OS/Version: Linux Status: NEW Severity: normal Priority: P3 Component: core AssignedTo: wayned@samba.org ReportedBy: tps@vr-web.de QAContact:

Hi, FWIW: /* Taken from R/src/main/unique.c */ static int requal(SEXP x, int i, SEXP y, int j) { if (i < 0 || j < 0) return 0; if (!ISNAN(REAL(x)[i]) && !ISNAN(REAL(y)[j])) return (REAL(x)[i] == REAL(y)[j]); else if (R_IsNA(REAL(x)[i]) && R_IsNA(REAL(y)[j])) return 1; else if (R_IsNaN(REAL(x)[i]) && R_IsNaN(REAL(y)[j])) return 1;

I am hoping someone will be kind enough to have a look at the following piece of code and tell me if there is a way to run lme() so it is a lot faster. The inner loop, j in 1:15000, takes about 2 hrs on my 2.8GHz dual Xeon 4GB RAM machine. The timings I have done show the dominant execution time is in lme. options(contrasts=c("contr.sum", "contr.sum"))

TLDR - The proposal below is intended to allow inlining of larger callees when such inlining is expected to reduce the dynamic instructions count. Proposal ------------- LLVM inlines a function if the size growth (in the given context) is less than a threshold. The threshold is increased based on certain characteristics of the called function (inline keyword and the fraction of vector

The vp3 / theora decoder in FFmpeg project received a major speedup: http://multimedia.cx/eggs/profiling-and-optimizing-theora/#comment-150751 http://git.ffmpeg.org/?p=ffmpeg;a=commit;h=6e8061980c9a18a0eb9802f5dc5becc349066680 http://git.ffmpeg.org/?p=ffmpeg;a=commit;h=8476744ba50d26a3e188def192cd9086b0f781d7 http://git.ffmpeg.org/?p=ffmpeg;a=commit;h=a51faef9b61bd80499a28322802ef4b22be44d43

Currently download.file() creates and terminates a new TLS connection for each download. This creates a lot of overhead which is expensive for both client and server (in particular the TLS handshake). Modern internet clients (including browsers) re-use connections for many http requests. We can do this in R by creating a persistent libcurl "multi-handle". The R libcurl implementation

I use rsync regularly for backups of large trees, sometimes over low bandwidth links, and I would like to suggest a potentially major speedup under some circumstances, where files or folders are moved or renamed. The principle is simple : often people rename a file, or move it from one folder to another. Current behaviour (please correct me if I am wrong) is for wget to see this as a

Hi, I have been playing with Altivec, and I rewrote a couple of the routines in assembly. Looking at the archives, I noticed that there may already be some effort on this. Anyways... Right now, I have two routines working. They need to be cleaned up, made relocatable, and documented; otherwise, they seem to work fairly well. I see an overall ~27% speed improvement when encoding with the

Hi, I found this surprising behavior with rsync (version 2.5.7 protocol version 26) on Mac OS X (Panther, 10.3.2) : Suppose you have a folder "Source" containing a file named "abc", and its backup as folder "Clone", created by rsync : rsync -a ~/Desktop/Source/ ~/Desktop/Clone Now change the name of file "abc" into "ABC" and re-sync :

Hello rsync list I've stumbled across a fairly obscure situation in which rsync hangs -- it just waits until I press ctrl-C. Here's a transcript. Note that directory foo contains two small files that are hard-linked together, and are unreadable. ---------------------------------------------------------------------- $ uname -a Linux ferox 2.6.35-28-generic-pae #50-Ubuntu SMP Fri Mar

Hello rsync people I've noticed an apparent inconsistency in the ordering of output from the --list-only option. For example: $ ls d1 d2 d2-x d3 f1 f2 f2-x f3 $ rsync --list-only . drwxr-xr-x 4096 2012/12/17 15:18:05 . -rw-r--r-- 0 2012/12/17 15:17:52 f1 -rw-r--r-- 0 2012/12/17 15:17:52 f2 -rw-r--r-- 0 2012/12/17 15:17:52 f2-x

Hello rsync people I thought I knew how to use rsync, but I can't work out how to use it to do the equivalent of cp -al dir1 dir2 where dir1 and dir2 are both local and on the same disk. In other words I want to make dir2 a copy of dir1, with every file hard-linked to its counterpart in dir1. Why not just use cp? Because I want to be able to do it as a user who has sudo

> I propose a patch to ifelse that leverages anyNA(test) to achieve an > improvement in performance. For a test vector of length 10, the change > nearly halves the time taken and for a test of length 1 million, there > is a tenfold increase in speed. Even for small vectors, the > distributions of timings between the old and the proposed ifelse do > not intersect. For smaller

You mean the input test data? I was testing performance using our offline perf suite (which is a ton of out of tree code), so it’s not something I can share, but I imagine any similar test suite put through a typical compiler pipeline will exercise ADCE in similar ways. ADCE’s cost is pretty much the sum of (cost of managing the set) + (cost of eraseinstruction), which in our case turns out to be

How about unique them both and compare the lengths? It's less work, especially allocation. Pete ____________________ Peter M. Haverty, Ph.D. Genentech, Inc. phaverty at gene.com On Thu, Jan 8, 2015 at 1:30 PM, peter dalgaard <pdalgd at gmail.com> wrote: > If you look at the definition of %in%, you'll find that it is implemented > using match, so if we did as you suggest,