Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Work out why 32-bit digits is slower than 64-bit digits with same fixnum size #28

Open
unzvfu opened this issue Mar 21, 2020 · 0 comments
Assignees

Comments

@unzvfu
Copy link
Owner

unzvfu commented Mar 21, 2020

From data61#48:

For example:

Function: mul_lo, #elts: 600e3
fixnum digit  total data   time       Kops/s
 bits  bits     (MiB)    (seconds)
[...]
   64    32       4.6     0.000     6122449.0
  128    32       9.2     0.000     3592814.4
  256    32      18.3     0.000     1583113.5
  512    32      36.6     0.001      493827.2
 1024    32      73.2     0.004      136549.8

   64    64       4.6     0.000     7792207.8
  128    64       9.2     0.000     4918032.8
  256    64      18.3     0.000     2135231.3
  512    64      36.6     0.001      657894.7
 1024    64      73.2     0.003      181928.4
[...]

The total data is different, so it's possible that this is a measurement mistake rather than a code generation problem.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant