next up previous contents index
Next: E.1 N-body integration Up: IV. Appendices Previous: D. Directory Structure   Contents   Index

E. Benchmarks

In this section we'll discuss some of the benchmarks. How fast does the N-body treecode run? To what degree does optimization/vectorizing help? When do programs become I/O dominated? Some of the numbers quoted below should be taken with great care, since a lot of other factors can go into the timing result.



Subsections

(c) Peter Teuben