Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!ihnp4!inuxc!pur-ee!uiucdcs!convex!barr
From: barr@convex.UUCP
Newsgroups: comp.os.cpm
Subject: Re: Help on caching algorythm?
Message-ID: <66100002@convex>
Date: Thu, 12-Mar-87 15:06:00 EST
Article-I.D.: convex.66100002
Posted: Thu Mar 12 15:06:00 1987
Date-Received: Sat, 14-Mar-87 06:26:06 EST
Lines: 8
Nf-ID: #R:<8703072310.AA02571@decwrl.dec.c:-35:convex:66100002:000:420
Nf-From: convex.UUCP!barr    Mar 12 14:06:00 1987


Take a look at Maurice J. Bach's book "The Design of the UNIX
Operating System."  Look specifically at the section describing
the chapter describing the algorithms and data structures used
to implement the buffer cache.  (I think it's in chapter 3.)
The key idea is that the linked list structures automatically
implement an LRU strategy which is a lot easier and faster than
maintaining and checking reference history.