sakw@cvaxa.UUCP (Sak Wathanasin) (05/05/86)
> Let me ask it again: does anybody know of cache organizations that do > something specific for keeping loop heads/return points around, or otherwise > use something that takes significant knowledge of I-behavior, OTHER than > the (well-known) linear pre-fetch desirability? I'm not sure what a "linear pre-fetch desirability" is, and I apologise if someone has already mentioned the following (we lost a lot of news a couple of weeks ago). The MU5 system developed at Manchester U had a "jump history table" that tried to predict branches using an associative memory in a way much like that used for page tables. The MU5 system was described in the 25th anniversary issue of CACM (sorry I can't remember which year, but it was the Jan issue). -- Sak Wathanasin, U of Sussex, Cognitive Studies, Falmer, Sussex BN1 9QN, UK uucp: ...mcvax!ukc!cvaxa!sakw arpa: sakw%uk.ac.sussex.cvaxa@uk.ac.ucl.cs janet: sakw@uk.ac.sussex.cvaxa