tag:blogger.com,1999:blog-1893218858608219953.post4323450579543210024..comments2020-12-25T15:26:28.854+10:00Comments on This is me: PARE - PARallel Execution in ErlangPhilip Robinsonhttp://www.blogger.com/profile/17605642659657207381noreply@blogger.comBlogger6125tag:blogger.com,1999:blog-1893218858608219953.post-68925977080799955972011-10-06T04:44:24.127+10:002011-10-06T04:44:24.127+10:00@Matthew, Am I missing something?
The expressions ...@Matthew, Am I missing something?<br />The expressions are spawned in order, and the results are received in the same order. The results may be sent out-of-order, but since the receive in the list comprehension is waiting for the results in order, that doesn't matter.<br />So, using the results wouldn't be misuse, as far as I can see.Kaoshttps://www.blogger.com/profile/14324168807573777805noreply@blogger.comtag:blogger.com,1999:blog-1893218858608219953.post-75056397214007467402008-03-22T10:16:00.000+10:002008-03-22T10:16:00.000+10:00This comment has been removed by a blog administrator.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-1893218858608219953.post-75353434039391664752007-12-03T09:00:00.000+10:002007-12-03T09:00:00.000+10:00Anonymous #2: all of the vertical bars were stripp...Anonymous #2: all of the vertical bars were stripped out of my code when I copied it here. Should be fixed now.<BR/><BR/>Matthew: I bow to the master. :-)Philip Robinsonhttps://www.blogger.com/profile/17605642659657207381noreply@blogger.comtag:blogger.com,1999:blog-1893218858608219953.post-53926093840901633222007-12-01T12:36:00.000+10:002007-12-01T12:36:00.000+10:00I like the idea, but I dislike the parse transform...I like the idea, but I dislike the parse transform syntax, so I wrote my own pareval module: http://paste.lisp.org/display/51674<BR/><BR/>With my syntax, you instead write pareval(Expr...), where Expr... is a list of expressions to be evaluated in parallel. If Expr is a match expression, then the pattern variables are matched in the caller's scope.<BR/><BR/>Using pareval, your fibb/1 function can be rewritten as:<BR/><BR/>fibb(0) -> 0;<BR/>fibb(1) -> 1;<BR/>fibb(N) -><BR/> pareval(A = fibb(N - 2),<BR/> B = fibb(N - 1)),<BR/> A + B.<BR/><BR/>(The version of pareval that I pasted returns a list of the evaluation results, but not necessarily in order. I am considering changing it to just return the atom 'pareval' to prevent accidental misuse.)Matthewhttps://www.blogger.com/profile/14779605288201636198noreply@blogger.comtag:blogger.com,1999:blog-1893218858608219953.post-28045501366797902892007-12-01T03:35:00.000+10:002007-12-01T03:35:00.000+10:00$anon@anon:~/$ erlc pare.erl./pare.erl:36: syntax ...$anon@anon:~/$ erlc pare.erl<BR/>./pare.erl:36: syntax error before: ASTIn<BR/>./pare.erl:42: syntax error before: ClausesIn<BR/>./pare.erl:60: syntax error before: ExprsIn<BR/>./pare.erl:78: syntax error before: ExprsIn<BR/>./pare.erl:33: function ast/2 undefined<BR/>./pare.erl:114: Warning: function new_var/0 is unused<BR/><BR/><BR/>failureAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-1893218858608219953.post-82664190748554461312007-11-30T23:57:00.000+10:002007-11-30T23:57:00.000+10:00Gracias!Gracias!Anonymousnoreply@blogger.com