Re: Benchmarking STL - is my code optimal?
David Abrahams wrote:
"Mirek Fidler" <cxl@ntllib.org> writes:
Maxim Yegorushkin wrote:
The results are intresting.
The test does i/o, string manipulation, container lookup and insert all
at the same time. I wonder if it is i/o bound or cpu bound?
That is on purpose. I wanted real-world example.
One man's real-world example is another's unimportant case. Lots of
people don't care very much how long their I/O takes as long as their
core computation is fast.
Or vice versa. Most of the applications I work on are IO bound,
and I think that that's pretty typical for commercial or
industrial software.
And of course, in most client software (client in the sense
client-server), what counts is the perceived speed. You can be
as slow as you want, as long as you do it when the user isn't
looking:-). (Adding a progress bar requires both additional IO
and additional CPU, but whatever you're doing is perceived as
going faster when the user sees some sort of visual progress.)
--
James Kanze (GABI Software) email:james.kanze@gmail.com
Conseils en informatique orient?e objet/
Beratung in objektorientierter Datenverarbeitung
9 place S?mard, 78210 St.-Cyr-l'?cole, France, +33 (0)1 30 23 00 34
--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]