Path: utzoo!utgpu!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ncar!tank!mimsy!chris
From: chris@mimsy.UUCP (Chris Torek)
Newsgroups: comp.arch
Subject: Re: Content Addressible Memories
Message-ID: <15041@mimsy.UUCP>
Date: 17 Dec 88 04:12:04 GMT
References: <12371@srcsip.UUCP> <367@enint.Wichita.NCR.COM> <1929@scolex>
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Lines: 19

In article <1929@scolex> seanf@sco.COM (Sean Fagan) writes:
>"Do not meddle in the affairs of wizards,
> for they are subtle, and quick to anger."

[And it is also said:  Go not to the Elves for counsel, for they will
say both no and yes.]

>I think that CAM would help AWK in many circumstances ....

Well, no and yes.

Awk wants to associate by arbitrary-length strings.  You would be faced
with a choice of variable length matching in hardware, with a very long
maximum, or limiting the match length, and both padding input as
necessary and breaking up long associations.  CAMs are, at present,
much better with fixed-length tags.
-- 
In-Real-Life: Chris Torek, Univ of MD Comp Sci Dept (+1 301 454 7163)
Domain:	chris@mimsy.umd.edu	Path:	uunet!mimsy!chris