Author: Matt Taylor
Date: 14:06:56 01/05/03
Go up one level in this thread
>I was chugging away on the older binary search routine yesterday. I've modified >it to use a 5th register. This allows me to stagger the accumulation and make >use of extra cycles that were burning waiting on instructions to retire. It is >amazingly efficient -- considering the maximum of 3 instructions/cycle, there >are only 7 slots wasted across the entire routine (38 instructions). This means >optimum execution time for this sequence is 13 cycles, and I'm doing it in 15. Oops, did I say 15? I should correct myself. I am now doing it in 14. Only 4 slots not utilized. I fixed a bug and gained performance. :-) -Matt
This page took 0.01 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.