[m-dev.] Implicit Parallelism test cases.

[Paul Bone]

Attention Peter Wang and Zoltan Somogyi.


I'm looking for test cases for implicit parallelism, namely programs
roughly the size of icfp2000 or smaller, that have some implicit
AND-parallelism and don't currently contain any parallel conjunctions.

Unfortunately icfp2000 is unsuitable since it threads IO state through
renderer.pixel_loop, which is the obvious place to introduce
parallelism, consequently there's not a lot of parallelism that can be
found here even if I'm able to find where the IO variables are produced
and consumed within recursive calls (which my analysis doesn't do
(yet)).

If icfp2000 has been modified to not thread the IO state through a lot
of the program (in particular the render loop), it would be perfect.
Peter, I understand you used a modified version of icfp2000 as a test
case in your honours thesis.  Do you still have this?  Do you think it
would be suitable?


Thanks.

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
URL: <http://lists.mercurylang.org/archives/developers/attachments/20081015/79fcd9c8/attachment.sig>