Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cornell!rochester!rutgers!njin!limonce From: limonce@pilot.njin.net (Tom Limoncelli) Newsgroups: comp.sys.amiga Subject: Re: Hard Drive Advice Summary: Looking for mathy people Keywords: HARD DRIVE MOUNTLIST PROGRAM Message-ID: Date: 30 Apr 89 00:07:19 GMT References: <6112@ardent.UUCP> Distribution: na Organization: NJ InterCampus Network, New Brunswick, N.J. Lines: 35 In article <6112@ardent.UUCP> rap@rap.ardent.com (Rob Peck) writes: > I did capture the hard-drive-blues story in the intro posting to > comp.sys.amiga.tech (from KJohn, I believe), and that certainly > is useful information. If anyone would like to volunteer other > information, I'd be very grateful. I have about another week > before I simply HAVE to turn in a few useful paragraphs about > this topic for the second edition of the Amiga Companion. I'd > be pleased to acknowledge any useful contributions to the topic... > see your name in print :-) :-) I was wondering if anyone out there has written a program that computes near-optimal mount lists? I.E. A program that I can say, "I want a ~10 meg partition, a partition exactly 880K, and the rest" or "I want a 2 ~twenty meg partitions and two 880K partitions" etc and get the proper mount lists with minimum wasted blocks? If I had TK!Solver on my IBM I could do it. If I had a decent spreadsheet on my Amiga I could figure it out. I know the problem is NP-Complete and the "about 10 meg" capability could really make for some interesting permutations but a mathematician should be able to work something out, right? Offer: I can program. I understand the problem enough to explain it to a mathematician. Can you do this kind of math? How would you like to get on a fish disk and become famous? Mail to me and maybe we can write a utility that will help out a lot of people. Tom -- Tom Limoncelli -- tlimonce@drunivac.Bitnet -- limonce@pilot.njin.net Drew University -- Box 1060, Madison, NJ -- 201-408-5389 Standard Disclaimer: I am not the mouth-piece of Drew University