[Savannah-register-public] [task #4344] Submission of bestfit

[Oskar Liljeblad]

URL:
  <http://savannah.gnu.org/task/?func=detailitem&item_id=4344>

                 Summary: Submission of bestfit
                 Project: Savannah Administration
            Submitted by: oskar
            Submitted on: Sat 07/02/2005 at 09:43
         Should Start On: Sat 07/02/2005 at 00:00
   Should be Finished on: Tue 07/12/2005 at 00:00
                Category: Project Approval
                Priority: 5 - Normal
                  Status: None
                 Privacy: Public
             Assigned to: None
        Percent Complete: 0%
             Open/Closed: Open
                  Effort: 0.00

    _______________________________________________________

Details:


Site Admin. Approval/Edition URL:
 <https://savannah.gnu.org/admin/groupedit.php?group_id=7772>


###### ORIGINAL SUBMISSION DETAILS ######

System Group Name:
-----------------
  bestfit


Full Name:
----------
  bestfit
  

Type:
-----
  non-GNU software & documentation


License:
-------- 
  GNU General Public License V2 or later


Other License: 
--------------
  


Description:
------------
  The purpose of this project is to host web site and file download area for
bestfit. If there is interest, we will create mailing lists and use CVS.

Bestfit is currently hosted on

  http://www.student.lu.se/~nbi98oli/bestfit/

The latest version can be downloaded from
 
  http://www.student.lu.se/~nbi98oli/src/bestfit-0.2.0.tar.gz

That page will be gone by the middle of July this year.
This is from the bestfit README:

Bestfit is a small program to determine which files that should be put
on a CD (or other media), so that as little space as possible is wasted. It is
very easy to use: you specify files on the command line, and bestfit prints
the names of those that were selected. Alternatively, bestfit can execute a
command for each selected file (e.g. to move them to a different directory).

This problem is also known as the 0-1 knapsack problem. The algorithm
implemented by bestfit solves instances of it optimally in theta(n*W)
time, where n is number of files to choose between and W the amount of
free space. This may sound bad but since W is number of blocks and not
bytes, this algorithm is not that inefficient. Try it yourself and see.

Due to the nature of this algorithm, bestfit uses a lot of memory -
approximately 1.5M per file specified on command line. As long as
you have enough swap space, this is usually not a problem since
bestfit doesn't use all at the same time.

Bestfit does (at this time) not use any external program such as mkisofs or
mkhybrid to calculate the size of files. Instead the file and directory sizes
and rounded up towards the nearest 2048-byte multiple and added together.
(2048 bytes is the block size on ISO images.)





Other Software Required:
------------------------
  GNU libc 2.0 or later



Other Comments:
---------------
  

#########################################







    _______________________________________________________

Reply to this item at:

  <http://savannah.gnu.org/task/?func=detailitem&item_id=4344>

_______________________________________________
  Message sent via/by Savannah
  http://savannah.gnu.org/