[Gems-users] Notary paper results

[Ricardo Quislant del Barrio <quislant@xxxxxxxxx>]

Hi all,
I'm trying to reproduce the results you obtained for Labyrinth benchmark 
in "Notary" paper
and I get the following:

-Perfect filter: 202 millions of Ruby_cycles
-H3_2048_4_Regular: 256 millions of Ruby_cycles
-H3_1024_4_Regular: 55 millions of Ruby_cycles
-H3_512_4_Regular: 95 millions of Ruby_cycles
-H3_256_4_Regular: 24 millions of Ruby_cycles
-H3_128_4_Regular: 29 millions of Ruby_cycles
-H3_64_4_Regular: 27 millions of Ruby_cycles

Ruby parameters:
   - protocol: MESI_CMP_filter_directory, logtm_se_virtualization
   - random_seed: 213
   - labyrinth input: -t15 -i inputs/random-x32-y32-z3-n16.txt

I'm not using the same number of hash functions neither the same input 
to labyrinth (I guess you're using "random-x48-y48-z3-n64.txt") but I 
was expecting consistent results like yours (not 10x more ruby_cycles 
for Perfect_filter than for H3_64_4_Regular).
I've posted about that but you didn't advice me how to get consistent 
results.
Could you give me some clues on how to get results like yours (protocol, 
paramaters, labyrinth modifications,...) ?
Thank you very much,
Ricardo