-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Also Sprach Jean-Louis Martineau:

> On Wed, Nov 20, 2002 at 01:47:50PM -0600, Deb Baddorf wrote:
> > What kind of optimiaztion does amanda use while flushing
> > dumps to tape?
> >
> > ... I'm hoping that some kind of
> > knapsack-packing algorithm is used ..... to fit the largest
> > files on the tape first,   but then to add smaller ones to
> > fill the top of the "sack".
> >      My archival "do all the level 0's" is taking up 5 tapes,
> > hence the optimization question!
>
> There is no optimazation, first in, first out.
> That's a need feature.
>
> Jean-Louis

Isn't the general knapsack problem one of these P==NP cases
like the traveling salesman problem? This might be challenging
even for the Amanda developers. I don't want the packing estimate
time to explode combinatorially, it takes long enough to back
up my terabytes over 100BaseT. Perhaps FNAL has enough
compute power to throw at it, but we don't. Not yet.

- ----
C. Chan <c-chan AT uchicago DOT edu>
GPG Public Key  ( pgp.mit.edu | finger cchan AT vader.bsd.uchicago DOT edu )
"Lif is laene: eal sceaceth, leoht ond lif samod"

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQE93BwwP6a1eh6rrMQRAsRiAJwJk5CY1a0ug4FrFc4C6MjdXpZrVACgnbQB
oAWTXIUYeNkT82LL+HABlwM=
=H+pH
-----END PGP SIGNATURE-----