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)
INTC 37.16+2.5%10:59 AM EST

 Public ReplyPrvt ReplyMark as Last ReadFilePrevious 10Next 10PreviousNext  
To: Joe NYC who wrote (151235)12/5/2001 6:33:17 PM
From: Tenchusatsu  Read Replies (1) of 186894
 
Joe, Kap's program does a lot of pipeline flushes. Every time the pipeline is flushed, the processor has to restuff the pipeline with instructions. If the next pipeline flush comes soon after the last one, overall performance will be limited by the latency of the pipeline.

Therefore, the results will be skewed by the number of cycles wasted by pipeline flushes. A more ideal test program would be one very long string of instructions with no inherent parallelism and no branches. Such a program will have no pipeline flushes whatsoever. Then the limiting factor will either be the decoder or the bandwidth of the L2 cache (or memory if the code can't fit inside the L2).

Tenchusatsu
Report TOU ViolationShare This Post
 Public ReplyPrvt ReplyMark as Last ReadFilePrevious 10Next 10PreviousNext