nine's paper

[Lucian Branescu]

The simple benchmark I see everywhere is a ring benchmark (like
http://muharem.wordpress.com/2007/07/31/erlang-vs-stackless-python-a-first-benchmark/)
In the case of parrot, it could be a ring of threads, each
incrementing the counter of the thread to its right.

Another common benchmark could be contention. Several threads, some
reading some writing to a single thread's resource.

Modelling a queue with scheduling might be a more complex example.

On 8 March 2012 09:39, Stefan Seifert <nine at detonation.org> wrote:
> On Thursday 08 March 2012 09:31:06 Lucian Branescu wrote:
>> Very interesting. The concept of sending a thread a function to change
>> itself with is very similar to Clojure's agent send-off.
>>
>> I'm curious how this would perform for less obviously parallel workloads.
>
> If you got a benchmark which is not too difficult to implement in PIR, I'd be
> quite happy to try it. I'm quite curious myself and need benchmarks for my
> paper anyway.
>
> Stefan
> _______________________________________________
> http://lists.parrot.org/mailman/listinfo/parrot-dev
>