Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!ames!oliveb!pyramid!decwrl!labrea!rocky!rokicki
From: rokicki@rocky.UUCP
Newsgroups: comp.sys.amiga
Subject: Re: Facc mini-review
Message-ID: <344@rocky.STANFORD.EDU>
Date: Tue, 2-Jun-87 17:20:09 EDT
Article-I.D.: rocky.344
Posted: Tue Jun  2 17:20:09 1987
Date-Received: Fri, 5-Jun-87 02:42:50 EDT
References: <326@esunix.UUCP> <2901@cit-vax.Caltech.Edu>
Organization: Stanford University Computer Science Department
Lines: 12
Keywords: facc cache disk accelerator nice program
Summary: LRU

walton@tybalt.caltech.edu (Steve Walton) writes:
> Perhaps
> Facc could count the number of times one of its cached blocks is
> accessed, and reuse the ones with the smallest count first;  I suspect
> this might add considerably to Facc's overhead, though.

Implementing a simple LRU queue would introduce almost zero overhead
(move a couple of links for each block accessed; very fast) but
would probably keep directory blocks around . . . is not this how
facc does it?  Perry?

-tom