[PD] pure data benchmark?

martin brinkmann mnb at martin-brinkmann.de
Wed May 6 12:16:41 CEST 2015


On 06/05/15 11:37, katja wrote:

> Actually chaosmonster1 is heavy on memory access because of the
> feedback delay lines.

yes, but maybe the delays are small enough to fit in the cache (if the
cache is big enough), and defeating the cpu cache would make
systems with small or big cache more comparable (i believe...)

> But I just noticed [block~ 1] in the delay line
> subpatches, meaning the patch does an unusual proportion of function
> call overhead. Maybe the patch is not the most representative use case
> of pd for that reason.

yes, throwing out the [block~ 1] makes some difference in cpu usage: 10
instances use about 24 instead of 33 percent here. (and it is not that
important for the sound) on the other hand i think reblocking
is quite common, so that the 'pd benchmark patch' should contain
some flanger or the like...

bis denn!
	martin



More information about the Pd-list mailing list