> > 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".

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.

LOL!   Yeah,  but I could swear I remember some simple
"greedy" algorithm from class,  which produces a reasonable
knapsack filling  without spending too much time doing it.
I'll think about it .....
Deb Baddorf
-------------------
Deb Baddorf         baddorf AT fnal DOT gov              840-2289
"You can't help getting older, but you don't have to get old."
- George Burns                                          <IXOYE><