Hi All, Well, I've developed this prime sieve algorithm, which is available
to read and download from the link below: "The Segmented Sieve of Zakiya (SSoZ)". http://www.scribd.com/doc/228155369/The-Segmented-Sieve-of-Zakiya-SSoZ I have implemented it in C++, D, et al, and want to see how well it can be done in a variety of languages to see its viability in them. The C++ implementation is less than 200 loc (lines-of-code) of actual code. There are two versions, one for single threaded operation and a parallel version using OpenMP. The paper provides a link to acquire the C++ source code. I would image someone who really knows Clojure could translate it probably within a day. I would imagine with more thought, and use of optimum Clojure idioms, it would be better than just a straight translation. My humble request, then, is if someone is interested in doing this I will be extremely grateful to them, and hopefully learn Clojure too. :-) I am greatly interested to see what the Clojure performance is for both the serial version, and a true parallel implementation, and particularly learning can it beat the C++ performance. If there are any questions, please contact me directly via my email provided in the paper, or here. Thanks in advance. Jabari Zakiya -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
