|Bignum and rational arithmetic email@example.com (1992-04-24)|
|Re: Bignum and rational arithmetic firstname.lastname@example.org (1992-04-29)|
|From:||email@example.com (Gene Ressler)|
|Organization:||Cornell Univ. CS Dept, Ithaca NY 14853|
|Date:||Fri, 24 Apr 1992 00:31:25 GMT|
I'm looking for references on run time systems for bignum and rational
arithmetic. Also algorithms and sources for existing systems and comments
from those with experience.
For the latter category, I've already looked at AKCL, PARI, MIT-Scheme,
and the C++ classes distributed with djgpp.
How about garbage collection issues? I've seen a variety of ideas --
explicit malloc()/free() with copying assign, reference counting, stack
allocation for expression temps, and of course general purpose gc.
How do bignum calculations map onto your favorite parallel architecture?
Has anyone seen architectures with hardware support for unlimited
Finally, who are the big users of bignums and rationals? I'm aware of
cryptography applications, also computational geometry. Others?
Return to the
Search the comp.compilers archives again.