Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!gem.mps.ohio-state.edu!apple!bionet!ames!uhccux!munnari.oz.au!cs.mu.oz.au!ok
From: ok@cs.mu.oz.au (Richard O'Keefe)
Newsgroups: comp.arch
Subject: Re: flexible caches
Message-ID: <2115@munnari.oz.au>
Date: 16 Sep 89 05:33:58 GMT
References: <224@qusunr.queensu.CA> <22151@cup.portal.com>
Sender: news@cs.mu.oz.au
Lines: 10

In article <22151@cup.portal.com>, mmm@cup.portal.com (Mark Robert Thorson) writes:
> In these cases, an even smarter cache might make use of a neural network
> to recognize which program should get caching of these memory locations.

This is a joke, right?  I mean, neural nets typically require THOUSANDS
of training runs to learn even the simplest things.  In this case, each
training run corresponds to a complete execution of the program.  If you
don't believe that neural nets learn slowly, get a copy of PDP vol 3 and
play with the programs in the enclosed floppies.  ["slowly" in the sense
of requiring many trials.  Obviously those programs could be a lot faster.]