diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2008-10-20 23:42:20 +0000 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2008-10-20 23:42:20 +0000 |
| commit | 3645d6c138b6e7710f3c3e2bca1e790b6b93d5d7 (patch) | |
| tree | 4577f136432303d16b81bc4b6b160b6c507610bb /bench/sparse_randomsetter.cpp | |
| parent | 96538b976db4d78f7ffd234b246007dcece3110a (diff) | |
sparse module: add a RandomSetter based on a user defined map implementation
as described on the wiki (one map per N column)
Here's some bench results for the 4 currently supported map impl:
std::map => 18.3385 (581 MB)
gnu::hash_map => 6.52574 (555 MB)
google::dense => 2.87982 (315 MB)
google::sparse => 15.7441 (165 MB)
This is the time is second (and memory consumption) to insert/lookup
10 million of coeffs with random coords inside a 10000^2 matrix,
with one map per packet of 64 columns => google::dense really rocks !
Note I use for the key value the index of the column in the packet (between 0 and 63)
times the number of rows and I used the default hash function.... so maybe there is
room for improvement here....
Diffstat (limited to 'bench/sparse_randomsetter.cpp')
0 files changed, 0 insertions, 0 deletions