<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<div class="moz-cite-prefix">On 06/07/2013 06:02 PM, Mikael wrote:<br>
</div>
<blockquote
cite="mid:CACbx-M_Yrt-VDOWG-Ab7JAWcWbfDJnZPvixVmmbLupw2nBJLyg@mail.gmail.com"
type="cite"><br>
<div>Was your Gambit pi-calculator compiled with (declare (not
safe)) and any other related setting for optimizing speed, like
increasing inlining, setting mostly generic and inlining
standard and extended bindings, and executed with a minimum heap
size of at least ~6MB?</div>
</blockquote>
<br>
The pi-calculator itself was interpreted; nearly all the work is
done in the Gambit runtime library. I suppose compiling it did
speed it up a bit:<br>
<br>
heine:~/programs/gambiteer/gambit> gsi chud1<br>
Chudnovsky's algorithm using binary splitting in Gambit Scheme:
digits 10, CPU time: 0..<br>
Last 5 digits 26535.<br>
Chudnovsky's algorithm using binary splitting in Gambit Scheme:
digits 100, CPU time: 0..<br>
Last 5 digits 70679.<br>
Chudnovsky's algorithm using binary splitting in Gambit Scheme:
digits 1000, CPU time: 0..<br>
Last 5 digits 1989.<br>
Chudnovsky's algorithm using binary splitting in Gambit Scheme:
digits 10000, CPU time: .024.<br>
Last 5 digits 75678.<br>
Chudnovsky's algorithm using binary splitting in Gambit Scheme:
digits 100000, CPU time: .43200000000000005.<br>
Last 5 digits 24646.<br>
Chudnovsky's algorithm using binary splitting in Gambit Scheme:
digits 1000000, CPU time: 6.151999999999999.<br>
Last 5 digits 58151.<br>
Chudnovsky's algorithm using binary splitting in Gambit Scheme:
digits 10000000, CPU time: 95.432.<br>
<br>
<br>
<blockquote
cite="mid:CACbx-M_Yrt-VDOWG-Ab7JAWcWbfDJnZPvixVmmbLupw2nBJLyg@mail.gmail.com"
type="cite">
<div>
<div>
<br>
<div>What's the scope of use of GMP in Python and in a
hypothetical Gambit GMP support patch, only integer bignums?</div>
</div>
</div>
</blockquote>
<br>
I don't know.<br>
<br>
<blockquote
cite="mid:CACbx-M_Yrt-VDOWG-Ab7JAWcWbfDJnZPvixVmmbLupw2nBJLyg@mail.gmail.com"
type="cite">
<div>
<div>
<div><br>
</div>
<div><br>
</div>
<div>
<div>If you have any thought on this feel free to share.</div>
</div>
<div><br>
</div>
<div><br>
</div>
<div>In all cases it's awesome that Gambit bundles its own
bignum logics as by that Gambit is without any dependency
requirement and thus makes Gambit completely portable and
self-sustaining.</div>
<div><br>
</div>
<div>Best regards,</div>
<div>Mikael</div>
<div><br>
<div class="gmail_quote">2013/6/7 Bradley Lucier <span
dir="ltr"><<a moz-do-not-send="true"
href="mailto:lucier@math.purdue.edu" target="_blank">lucier@math.purdue.edu</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0
.8ex;border-left:1px #ccc solid;padding-left:1ex"><br>
heine:~/programs/gambiteer/gambit> gsi chud1.scm<br>
Chudnovsky's algorithm using binary splitting in Gambit
Scheme: digits 10, CPU time: 0..<br>
Last 5 digits 26535.<br>
Chudnovsky's algorithm using binary splitting in Gambit
Scheme: digits 100, CPU time: 0..<br>
Last 5 digits 70679.<br>
Chudnovsky's algorithm using binary splitting in Gambit
Scheme: digits 1000, CPU time: .004.<br>
Last 5 digits 1989.<br>
Chudnovsky's algorithm using binary splitting in Gambit
Scheme: digits 10000, CPU time: .028.<br>
Last 5 digits 75678.<br>
Chudnovsky's algorithm using binary splitting in Gambit
Scheme: digits 100000, CPU time: .472.<br>
Last 5 digits 24646.<br>
Chudnovsky's algorithm using binary splitting in Gambit
Scheme: digits 1000000, CPU time: 6.448.<br>
Last 5 digits 58151.<br>
Chudnovsky's algorithm using binary splitting in Gambit
Scheme: digits 10000000, CPU time: 98.612.<br>
Last 5 digits 55897.<br>
</blockquote>
</div>
</div>
</div>
</div>
</blockquote>
<br>
</body>
</html>