🚀 go-pugleaf

i am sorry. you are not saying anything of substance.  any cache is
unstable if it's working set exceeds the size of the cache.
apparently this is the case for your whetstone application.

the instruction cache can provide from 0 to 20 percent improvement to
the overall execution rate. the lower bound occurs for 'large working
sets' of code, while the upper bound occurs for 'small working sets'
of code.

for example, 64KB of cache will do absolutely NOTHING for inline code
without loops. There is nothing UNSTABLE about the hardware that
causes it to provide 0 percent speedup. The algorithm may also have
nothing wrong with it.  the 2 simply are not a good match; other
applications do get benifit from a code cache. typically search and
sort routines see alot of benifit. bitblt typically fits inside the
020 cache.

the message is that if you want better performance from your cache,
you had better fine tune your algorithm. if you can't (or don't want
to) then take your lumps.

as for "nearly identical code" behaving totally differently I suggest
that your definition of nearly identical is flawed.  Apparently it
means alot to the hardware, your scope is too global to understand
ways around the problem.

i hope that this has been helpful. 

richard
att info sys.