Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site ganash.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!hjuxa!ganash!russ
From: russ@ganash.UUCP (Russ Wolf)
Newsgroups: net.arch,net.wanted,net.wanted.sources
Subject: Want Paging and/or Caching Implementations
Message-ID: <197@ganash.UUCP>
Date: Thu, 12-Dec-85 16:33:50 EST
Article-I.D.: ganash.197
Posted: Thu Dec 12 16:33:50 1985
Date-Received: Fri, 13-Dec-85 20:29:21 EST
Distribution: net
Organization: Periphonics Corp, Bohemia, NY
Lines: 20
Xref: watmath net.arch:2269 net.wanted:7740 net.wanted.sources:1625

Hi,
I am looking for software implementations (in C) of algorithms that
solve the (more or less) general caching problem of having a limited
amount of memory into which I will be loading and unloading entries
from disk for use by other applications.
The problem, of course, is knowing what to unload when things are full.

I already know a few algorithms for handling this situation (although
I wouldn't mind more references if this search doesn't pan out),
however, I am looking for existing implementations to avoid re-inventing
well worn wheels.

Please reply by mail, if response indicates I will post a summary.
-- 
	Thanx muchly,

	Russ Wolf
	hjuxa!ganash!russ
	Periphonics Corp., 4000 Veterans Memorial Highway, Bohemia, NY 11716
	(516) 467-0500