[Pharo-project] Counting Messages as a Proxy for Average Execution Time in Pharo
siguctua at gmail.com
Fri Apr 29 17:27:45 CEST 2011
On 29 April 2011 01:03, Stefan Marr <pharo at stefan-marr.de> wrote:
> On 29 Apr 2011, at 00:32, Nicolas Cellier wrote:
>> However, as I understand it, it's entirely up to user to write code
>> exploiting parallel Process explicitly right ?
> Sure, you have to do: n times: [ [ 1 expensiveComputation. ] fork ].
> I don't belief in holy grails or silver bullets.
> Automatic parallelization is something nice for the kids, like Santa Clause or the Easter Bunny...
People tend to forget that parallel algorithms are different by
nature, and there is no way to automatically convert arbitrary
single-threaded algorithm to parallel one,
without thinking about rearranging data structures and control flow.
> Best regards
> Stefan Marr
> Software Languages Lab
> Vrije Universiteit Brussel
> Pleinlaan 2 / B-1050 Brussels / Belgium
> Phone: +32 2 629 2974
> Fax: +32 2 629 3525
Igor Stasenko AKA sig.
More information about the Pharo-project