Date: Thu, 28 Aug 1997 08:10:55 -0700 (MST) From: Terry Lambert <terry@lambert.org> To: Shimon@i-connect.net (Simon Shapiro) Cc: peter@spinner.dialix.com.au, petrilli@amber.org, smp@FreeBSD.ORG, peters@gil.com.au, mestery@winternet.com Subject: Re: A how does it work question. Message-ID: <199708281510.IAA00933@phaeton.artisoft.com> In-Reply-To: <XFMail.970827231837.Shimon@i-Connect.Net> from "Simon Shapiro" at Aug 27, 97 11:18:37 pm
next in thread | previous in thread | raw e-mail | index | archive | help
> Of course you are right. I will not mention my contribution to the concept > of ``giant lock''. But trust that I understand it, although I may not be > able to say so in a streight sentence :-) > > Now, ffs is a different story :-) FFS *can* be trivial. You just have to divorce blocking and non-blocking operations. The technology to do this is called "soft updates". 8-). For a general soloution instead, which will work with all FS's, even under stacking, a graphical soloution is required. You precompute Warshal's over the graph for everything but the next event to be added. This lets you (1) recompute it in linear time (O(n)), and (2) run dependencies between stacked layers. Terry Lambert terry@lambert.org --- Any opinions in this posting are my own and not those of my present or previous employers.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199708281510.IAA00933>