As none of the previous traps has worked, Wile is going to give it one last chance. This time the idea is that if one Wile cannot catch the RoadRunner, then perhaps 10 can!
Wile has bought a clone machine from ACME. The idea is that Wile can clone himself in nine more versions, and then the lot of them can easily catch the RoadRunner.
Since Wile is a cartoon character a clone machine is in fact simply a ray-tracer, and a parallel version of this will allow Wile to quickly generate the nine clones so that the hunt can begin.
The clone machine
The solution should be implemented using Java Spaces, and based on the sequential version below. The code should be run on from one through eight nodes.
The report should identify
the various choices that has been made as well as individual techniques
that has
been applied to improve
performance. And the impact of each should be documented. In addition the
scalability of your implementation should be discussed and the achieved
performance curve should be discussed.
Any optimization may be applied,
if and only if the result is correct and independent of the number of nodes
that
are used to achieve the
solution. Any optimization that is applied must be thoroughly described.
Everything must be completed in Java, e.g. it is not enough to use a Java front-end ad write the main loop in C.