* John R. Jackson [EMAIL PROTECTED] (Tue, Feb 20, 2001 at 07:53:20PM -0500)
Next we need to examine the driver algorithm in more detail. Some of
the base information is in the usenix paper on the ftp.amanda.org site.
[8]
If inparallel is set to three (or less), you don't have any "big"
"John" == John R Jackson [EMAIL PROTECTED] writes:
John Planner generates the list of what to do based on size, requests for
John special service (forced full dumps, etc) and so on. That's a text "file"
John with one line per disk piped into driver.
Does the planner consider the
Wouldn't it be easer to (try and) change the code to use this priority
field also for normal operation ?
Possibly. I've wondered why the value is not used for this as well.
It would be disgustingly easy (which may or may not be a good thing :-)
-- we just need to change the sort routine used
I have a couple of machines that are slow and poorly connected to my
tape server. In every instance, I happen to *know* that if these
machines were to appear first in the backup schedule, the backup would
finish more quickly.
Is there a way I can push them to the front?
Ben
I have a couple of machines that are slow and poorly connected to my
tape server. In every instance, I happen to *know* that if these
machines were to appear first in the backup schedule, the backup would
finish more quickly.
Is there a way I can push them to the front?
That's harder than you
Ben Elliston wrote:
I have a couple of machines that are slow and poorly connected to my
tape server. In every instance, I happen to *know* that if these
machines were to appear first in the backup schedule, the backup would
finish more quickly.
Can you put in a delay time for all the
