Subj : Re: A multithreading benchmark
To   : comp.programming.threads
From : Torsten Robitzki
Date : Tue Jun 07 2005 01:18 am

Hi Chris,

chris noonan wrote:

> I am designing a benchmark program for investigating
> multithreaded performance. I will use the program
> for comparing various heap managers, but it is bound
> to be useful for other purposes.
> 
> These are the design criteria I have so far:
> 
> 1. The benchmark will be semi-synthetic, in that
> it will be constructed for the stated purpose,
> but will perform some useful task, and could be
> mistaken for a 'real' application.
> 
> 2. The program will take the server role of a
> client-server system, and will run on a
> thread-per-connection basis.
> 
> 3. There will be a fixed amount of work, the
> number of threads will be parameterisable for
> each run of the benchmark, and the workload
> will be divided between however many threads
> there are.
> 
> 4. The program will be coded in C++ in natural
> style.
> 
> 5. The dynamic memory profile of the running
> benchmark will conform as far as possible to
> empirical measurements of average allocation
> size, duration etc. to be found in the
> literature.
> 
> Anything else worth considering?

I fail to get what you want to benchmark. Initial it where "various heap 
managers", but how would that connect to a "thread-per-connection 
basis", where you for sure spend more time waiting for a complete IO 
then to allocate memory. Do I miss some connection?

regards
Torsten

.