| Performance test based on a tree model with one root, NUMBER_OF_SONS children
and NUMBER_OF_GRANDCHILDREN_PER_SON children for each child node.
The tree is described by father facts, and there is one rule describing
what it means to be sibling (brother). The number of expected results is:
(using N for NUMBER_OF_SONS and G for NUMBER_OF_GRANDCHILDREN_PER_SON)
N*(N-1) + N*G+(G-1).
E.g., in this class we use N=25 and G=3, this yields 750.
We run the computation 3 times to give JIT compilers time to optimize code execution.
1st run solutions found: 750 time (in millis): 511
2nd run solutions found: 750 time (in millis): 320
3nd run solutions found: 750 time (in millis): 280
Same as before, but uses BEA's jrockit 81 sp2_141_05 JVM:
1st run solutions found: 750 time (in millis): 420
2nd run solutions found: 750 time (in millis): 231
3nd run solutions found: 750 time (in millis): 360
author:
Jens Dietrich
version:
3.4 <7 March 05>
since:
2.1 |
