@pavlobaron Example. Fixed size aggregation with sliding window size of 2, in COTS CEP? 3M/sec max. My one? 2.7B/sec once JITted.
-
-
Replying to @pavlobaron
@pavlobaron@nivertech Was thinking the other day. Want complexity JUnit ext - assertComplexity(One) - would rock in PBT too (cc@KentBeck)1 reply 0 retweets 0 likes -
Replying to @darachennis
@darachennis@pavlobaron@nivertech i've done that by asserting timeToRun(1e3) * 1e3 ~= timeToRun(1e6). is there a framework there, tho?3 replies 0 retweets 0 likes
Replying to @KentBeck
@KentBeck @pavlobaron @nivertech Yes. Take repeated test runs & assert algorithm exhibits desired complexity... Desirable in HPC contexts..
1:27 PM - 3 Aug 2012
from Hammersmith and Fulham, England
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.