On Fri, 2016-02-26 at 12:06 -0600, Ranjan Maitra wrote:
Thank you! So, is there any way that these other processes can be
separated out in the time calculations? I can not come up with
definitive statements unless I can do these comparisons in a fair
manner.
Not really. The days of purely deterministic computing are long gone.
What you can do is what most benchmarks do, run the program many times
and calculate an average time. Depending what your program does though
you may have to take steps to ensure the second and later runs are
truly representative such as making sure nothing is still cached in theCPU cache, pages
purged in memory, residing in the disc cache, etc. Be sure to consider everything that
might make the second run go faster than the first.
Those sort of issues are why the literature on benchmarking gets
complicated really fast.