Hi, > Similar to Justin's caching suggestion, can the results of the past run be > stored somewhere so only the new records need to be tested?
I was thinking of caching results as you go around the loop, if the calculations use similar values or there's a lot of duplicates in those arrays then caching results or storing results in map is likely to help (at the expense of more memory). But without know the data or calulatio it’s a little hard to guess. > If the trig is the issue, then you have to look at the trig and determine > how much of it can be run in parallel. Depending on how accurate you need the results trig maps / tables may also help [1][2] Thanks, Justin 1. http://lab.polygonal.de/2007/07/18/fast-and-accurate-sinecosine-approximation/ 2. http://jacksondunstan.com/articles/1190
