Hello,
This Scratch pool algorithm problem has turned out to be quite interesting. As
it turns out, the guys that asked for the change in the algorithm were
correct and the guys that are complaining about the change in the algorithm
are correct, and best of all I think I have a solution that will satisfy
everyone.
Without going into a huge number of details, I'll simply say that the original
algorithm was broken because it never looked for a Scratch volume in the
autochanger. By the time it looked for a scratch volume, it was willing to
accept any volume (a sort of last resort panic to find anything ...).
So, now everyone *should* be satisfied. The recycling code will be exercised
first as it should, and only if there is not an available volume in the
autochanger will Bacula look to see if there is a Scratch volume in the
autochanger. This allows Bacula to add new Volumes when really needed
without immediately consuming all the Scratch volumes in the changer.
--
Best regards,
Kern
(">
/\
V_V
-------------------------------------------------------
This SF.Net email is sponsored by xPML, a groundbreaking scripting language
that extends applications into web and mobile media. Attend the live webcast
and join the prime developer group breaking into this new coding territory!
http://sel.as-us.falkag.net/sel?cmd=lnk&kid=110944&bid=241720&dat=121642
_______________________________________________
Bacula-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/bacula-users
