Path: utzoo!mnetor!uunet!seismo!esosun!ucsdhub!sdcsvax!earle@mahendo.Jpl.Nasa.Gov
From: earle@mahendo.Jpl.Nasa.Gov (Greg Earle)
Newsgroups: comp.os.research
Subject: Re: O/S's using bit maps for free disk block lists?
Message-ID: <4823@sdcsvax.UCSD.EDU>
Date: 31 Mar 88 07:24:47 GMT
Sender: nobody@sdcsvax.UCSD.EDU
Organization: Gainfully Unemployed Ltd., Lakeview Terrace  CA
Lines: 26
Approved: comp-os-research@ucsd.edu

In article <4811@sdcsvax.UCSD.EDU> I wrote:
>I once worked on a project ... that ... used [ a ]
>bitmap scheme for the free disk block list.  Seeing this exercise got me
>curious as to whether anyone has tried implementing this as a research project
>using a UNIX system as a base, or conversely, do any extant O/S research
>projects use this method?

Everyone has been kindly reminding me that 4.x BSD UNIX uses such a scheme.
Yes, thank you, I knew that already (I'd be a pretty sad consultant otherwise).
My trusty copy of `A Fast File System for UNIX' is within easy reach ...

What I was *really* thinking when I said `UNIX system' was a System V-based or
BTL Research (i.e., V8 or V9) version (sorry, mass-Bach reading has me in
System V mode).  After having used it for 4 years I sort of forgot that 
4.x BSD UNIX can (and still is) be called a `research project'.  What I was
*really* thinking when I said [ (-: ] `research project' was things I know
little of, like Sprite for example.

Sorry for the confusion ...


-- 
	Greg Earle		earle@mahendo.JPL.NASA.GOV
	Indep. Sun consultant	earle%mahendo@jpl-elroy.ARPA	[aka:]
	(Gainfully Unemployed)	earle%mahendo@elroy.JPL.NASA.GOV
	Lake View Terrace, CA	...!{cit-vax,ames}!elroy!jplgodo!mahendo!earle