SI
SI
discoversearch

We've detected that you're using an ad content blocking browser plug-in or feature. Ads provide a critical source of revenue to the continued operation of Silicon Investor.  We ask that you disable ad blocking while on Silicon Investor in the best interests of our community.  If you are not using an ad blocker but are still receiving this message, make sure your browser's tracking protection is set to the 'standard' level.
Technology Stocks : Intel Corporation (INTC) -- Ignore unavailable to you. Want to Upgrade?


To: Charles Gryba who wrote (150843)12/3/2001 4:49:14 PM
From: Joe NYC  Respond to of 186894
 
The idea is that you have a huge case statement ( the one I tried was 10000 cases long ) and you randomly branch in there for 10 million iterations.

That's a clever idea. I was trying to come up with a way to come up with a huge chunk of code that would not fit in trace cache, and something this simple didn't occur to me.

Joe



To: Charles Gryba who wrote (150843)12/3/2001 5:39:38 PM
From: wanna_bmw  Respond to of 186894
 
Constantine, if you read my response to Jozeph, you will see why I think Kap's program will prove nothing about the speed of the decoders. There are simply too many variables that are effected if the trace cache gets a 100% miss rate. Maybe Kap has figured out something more than I have, but go ahead and post your results. I'm sure he'll do his book burning Indian dance (reference from Shawshank Redemption) no matter what the consequences of the results are.

wbmw