On Tue, Feb 01, 2011 at 12:49:00PM +0200, Elazar Leibovich wrote: > The program they tested[1] is strictly CPU bound. BTW, standard deviation > wouldn't work as well, but it shows (I think) that there's no such think as > "ideal minimal runtime". > > [1] > static int i = 0, j = 0, k = 0; > int main() { > int g = 0, inc = 1; > for (; g<65536; g++) { > i += inc; > j += inc; > k += inc; > } > return 0; > } > > [2] http://www-plan.cs.colorado.edu/diwan/asplos09.pdf
That program is CPU-bound, but the time it runs is short enough for the size of the environment to actually mean something. -- Tzafrir Cohen | tzaf...@jabber.org | VIM is http://tzafrir.org.il | | a Mutt's tzaf...@cohens.org.il | | best tzaf...@debian.org | | friend _______________________________________________ Linux-il mailing list Linux-il@cs.huji.ac.il http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il