Date: Thu, 28 Aug 1997 10:29:58 -0500 (EST) From: "John S. Dyson" <toor@dyson.iquest.net> To: terry@lambert.org (Terry Lambert) Cc: Shimon@i-connect.net, 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: <199708281529.KAA02111@dyson.iquest.net> In-Reply-To: <199708281510.IAA00933@phaeton.artisoft.com> from Terry Lambert at "Aug 28, 97 08:10:55 am"
next in thread | previous in thread | raw e-mail | index | archive | help
Terry Lambert said: > > 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. > Sounds like 72lbs of code to me :-). -- John dyson@freebsd.org jdyson@nc.com
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199708281529.KAA02111>