<div dir="ltr">You might try places. Writing your own gcd seems straightforward. I'm not sure about integer-sqrt?, tho. Maybe you could make a table or something if you know there are not that many numbers. <div><br></div>
<div>Or maybe someone will adjust the runtime to make those future safe!<br><div><br></div><div>Robby</div></div></div><div class="gmail_extra"><br><br><div class="gmail_quote">On Wed, Jul 24, 2013 at 11:34 PM, Joe Gilray <span dir="ltr"><<a href="mailto:jgilray@gmail.com" target="_blank">jgilray@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">So I should write my own (gcd ) and (square? ) functions?<div><br></div><div>I can try that, but isn't there a simple way to use threads?</div>
<div><br></div><div>Thanks,</div><div>-Joe</div><div><div>
<br></div><div><br></div></div></div><div class="HOEnZb"><div class="h5"><div class="gmail_extra"><br><br><div class="gmail_quote">On Wed, Jul 24, 2013 at 7:47 PM, Robby Findler <span dir="ltr"><<a href="mailto:robby@eecs.northwestern.edu" target="_blank">robby@eecs.northwestern.edu</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">When I run this, the future visualizer shows that gcd and square-number? block the futures. square-number? is implemented in TR and if you take it, you find that integer-sqrt also blocks the futures. I'm not sure if those functions can be made to run safely in futures or not.<div>
<br>Robby</div></div><div class="gmail_extra"><br><br><div class="gmail_quote"><div><div>On Wed, Jul 24, 2013 at 7:26 PM, Joe Gilray <span dir="ltr"><<a href="mailto:jgilray@gmail.com" target="_blank">jgilray@gmail.com</a>></span> wrote:<br>
</div></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div><div><div dir="ltr">I have a ProjectEuler problem that I wanted to speed up so I thought I would try to speed it up with future / touch.<div>
<br></div><div>I tried the following:</div><div><br></div><div><div><font face="courier new, monospace">; function that searches for progressive numbers for a given range of b values</font></div>
<div><font face="courier new, monospace">(define (find-progressive-num b-start b-end b-incr lim)</font></div><div><font face="courier new, monospace"> (for/sum ([b (in-range b-start b-end b-incr)])</font></div><div><font face="courier new, monospace"> (let loopa ([a (add1 b)] [suma 0])</font></div>
<div><font face="courier new, monospace"> (cond</font></div><div><font face="courier new, monospace"> [(> (gcd a b) 1) (loopa (add1 a) suma)]</font></div><div><font face="courier new, monospace"> [(>= (* a a a b) lim) suma]</font></div>
<div><font face="courier new, monospace"> [else</font></div><div><font face="courier new, monospace"> (let loopc ([c 1] [sumc 0])</font></div><div><font face="courier new, monospace"> (define n (+ (* a a a c c b) (* c b b)))</font></div>
<div><font face="courier new, monospace"> (cond</font></div><div><font face="courier new, monospace"> [(>= n lim) (loopa (add1 a) (+ suma sumc))]</font></div><div><font face="courier new, monospace"> [(square-number? n) (loopc (add1 c) (+ sumc n))]</font></div>
<div><font face="courier new, monospace"> [else (loopc (add1 c) sumc)]))]))))</font></div><div><br></div><div><font face="courier new, monospace">; ProjectEuler problem #141</font></div><div><font face="courier new, monospace">; n = q * d + r</font></div>
<div><font face="courier new, monospace">; q/d = d/r = a/b (where a and b are relatively prime)</font></div><div><font face="courier new, monospace">; so d = a*r/b and q = a^2 * r / b^2</font></div><div><font face="courier new, monospace">; since a and b are coprime r must be divisible by b^2 or r = c*b^2</font></div>
<div><font face="courier new, monospace">; substituting: d = a*c*b and q = a^2*c</font></div><div><font face="courier new, monospace">; n = a^3 * c^2 * b + c * b^2</font></div><div><font face="courier new, monospace">(define (euler141)<br>
</font></div><div><font face="courier new, monospace"> (define lim 10000000000)</font></div><div><font face="courier new, monospace"> (let ([f1 (future (λ () (find-progressive-num 1 1000 2 lim)))])</font></div><div><font face="courier new, monospace"> (+ (find-progressive-num 2 1000 2 lim) (touch f1))))</font></div>
</div><div><br></div><div>Unfortunately this runs no faster than the sequential version. I tried using the future-visualizer but I couldn't understand what it was telling me (I guess some operation is blocking). I also tried finer grained threads (one for each value of b), but that did no better.</div>
<div><br></div><div>Can anyone give me some pointers to successfully using future / touch?</div><div><br></div><div>Thanks,</div><div>-Joe</div></div>
<br></div></div>____________________<br>
Racket Users list:<br>
<a href="http://lists.racket-lang.org/users" target="_blank">http://lists.racket-lang.org/users</a><br>
<br></blockquote></div><br></div>
</blockquote></div><br></div>
</div></div></blockquote></div><br></div>