Is there not a way to have your parallel parsing cake and eat a deterministic ordering too? Namely, generate the (undeterministic) list of possible parses and then parallel mergesort it in some way that imposes a deterministic total order on distinct parses. Lexicographic would suffice, I'd expect.
Or maybe even just build the output up in a sorted-set held in an atom, for that matter. The sorted inserts will be distributed among the various threads, and retries will be rare if the parse generating time dominates the sorted-insert time by an order or two of magnitude. -- -- 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/groups/opt_out.
