undefined | Better HN

0 pointsspeeder13y ago0 comments

I doubt that you can have a much increase in performance as cores increase unless you are calculating numbers with huge amount of bits.

0 comments

tbrownaw13y ago

Considering that factorial of 1e6 has about 18e6 bits (and factorial of 1e3 has 8.5e3 bits)? Yes, any factorial that doesn't have a huge amount of bits will be fast enough to calculate that there's not much point to parallelizing it.

PurplePanda13y ago

as the size of the input to the procedure increases you will indeed be calculating with numbers with a huge amount of bits

j / k navigate · click thread line to collapse

0 pointsspeeder13y ago0 comments

I doubt that you can have a much increase in performance as cores increase unless you are calculating numbers with huge amount of bits.

0 comments

tbrownaw13y ago

PurplePanda13y ago

as the size of the input to the procedure increases you will indeed be calculating with numbers with a huge amount of bits

j / k navigate · click thread line to collapse