|
From: | Dustin Sallings |
Subject: | Re: [Gnu-arch-users] larger trees slowing down |
Date: | Wed, 28 Jan 2004 09:54:43 -0800 |
On Jan 28, 2004, at 0:56, Robert Collins wrote:
On Wed, 2004-01-28 at 05:02, Dustin Sallings wrote:The surprising part is that applying an individual patch (at least as part of get) seems rather slow, even though they're mostly very small patches. Replay actually applies the patches fairly quickly, though.So, if you get (say) 100 revisions back from the leading edge. And then replay, how long does each patch take? And how does that compare to the application during get? I.E. Are we looking at the same time interval multiplied by # of revisions, or is get actually slower in some fashion.
OK, here's what I've got: tla get ...patch-2200 (cacherev) 3.650u 7.000s 0:32.26 33.0% 0+0k 447+3309io 0pf+0w tla replay 128.090u 43.810s 3:36.74 79.3% 0+0k 154+938io 0pf+0w tla get ... 229.780u 92.740s 6:31.65 82.3% 0+0k 71+1802io 0pf+0wThis was the same, local tree. I did the replay version first, which should have put it at a disadvantage, as well.
-- Dustin Sallings
[Prev in Thread] | Current Thread | [Next in Thread] |