With a simple bash script, I’ve monitored the entropy in /dev/random, the entropy of the Linux kernel entropy pool. Note however that the way I’ve done it, it lowers the entropy’s pool level by a few bits at every entropy’s level check. So that I’ve limited the entropy checking at a frequency of 1 measurement every 2 seconds, during 6000 seconds (1 h 40 mins).
Here’s a quick summary of the data obtained:
Min. : 728.0
1st Qu.: 929.0
Median : 986.0
Mean : 982.3
Here’s a histogram and a plot of the entropy pool level in function of time:
Using the following R code: https://github.com/arbolis/personalscripts/blob/master/fishtest.R, I’ve collected some data about fishtest, the Stockfish chess engine testing framework (http://tests.stockfishchess.org/tests).
In the first graph below we can see that the most numerous computing power contributors have quad-cores, followed by dual-cores and then octa-cores. Note that fishtest sets the number of cores equal to the number of physical cores minus one, hence a quad-core appears as having 3 cores.
In the second graph we can see the Mnps (mega nodes per second), which is related to the cpu latency of the machines. The value 0.00 Mnps is there because the machine didn’t finish to compile Stockfish and didn’t have the time to either run the bench command or to start a game (I don’t remember which one of the two sets the Mnps displayed).