|
From: <sv...@va...> - 2005-12-13 17:20:28
|
Author: njn Date: 2005-12-13 17:20:24 +0000 (Tue, 13 Dec 2005) New Revision: 5330 Log: File recording info about each performance benchmark. Added: trunk/perf/README Added: trunk/perf/README =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D --- trunk/perf/README (rev 0) +++ trunk/perf/README 2005-12-13 17:20:24 UTC (rev 5330) @@ -0,0 +1,34 @@ +------------------------------------------------------------------------= ----- +Notes about performance benchmarks +------------------------------------------------------------------------= ----- +For each benchmark, here is a brief description and notes about strength= s +and weaknesses of the benchmark. + +bz2: +- Description: Burrows-Wheeler compression and decompression. +- Strengths: A real, widely used program, very similar to the 256.bzip= 2 + SPEC2000 benchmark. Not dominated by any code, the hotte= st + 55 blocks account for only 90% of execution. Has lots of + short blocks and stresses the memory system hard. +- Weaknesses: None, really, it's a good benchmark. + +fbench: +- Description: Does some ray-tracing. +- Strengths: Moderately realistic program. +- Weaknesses: Dominated by sin and cos, which are not widely used, and = are + hardware-supported on x86 but not on other platforms such= as + PPC. + +ffbench:=20 +- Description: Does a Fast Fourier Transform (FFT). +- Strengths: Tests common FP ops (mostly adding and multiplying array + elements), FFT is a very important operation. +- Weaknesses: Dominated by the inner loop, which is quite long and flat= ters + Valgrind due to the small dispatcher overhead. + +sarp: +- Description: Does a lot of stack allocation and deallocation. +- Strengths: Tests for a specific performance bug that existed in 3.1.= 0 and + all earlier versions. +- Weaknesses: Highly artificial. + |