Simplest (practical) file system?

From: Patrick Rigney <patrick_at_evocative.com>
Date: Mon Jul 28 14:31:00 2003

> >lot. If you do a linear search for a free block, it may be that
> you can rip
> >through the 255-valued bytes quickly, but they have to be in
> RAM, so you may
> >have to do several reads to find what you want, which saps time.
>
>
> I wonder if it really would sap a lot of time. Modern IDE drives have
> large cache buffers so I would think that system could very
> likely read the
> data from the buffer. I'm thinking that as slow as these old systems are
> and as fast as the modern drives are that it would be better to use a
> simple and fast algorithim even if it means more drive accesses.
>
> Joe

Joe, that is absolutely true. I was not considering the speed or caching
abilities of the drive itself. I was thinking more generically of an
approach that would work OK for both a sluggish floppy and a faster hard
disk without software changes. Additional accesses penalize floppies, but
that may not be an issue for Bob. --Patrick
Received on Mon Jul 28 2003 - 14:31:00 BST