Parallel Minimum Spanning Tree Algorithm

In the graduate course Concurrent Object Oriented Languages, taught at York University, Toronto, students do three assignment and write a paper based on these assignments.

The objective of the first assignment is to find a nontrivial concurrent algorithm in the literature. In the second assignment, the aim is the implementation of the concurrent algorithm presented in the first assignment in Java. The focus of the third assignment is to apply tools to verify the concurrent Java program of the second assignment.

The paper should cover the material discussed in the three assignments. The paper should not be produced by simply cutting and pasting parts of the assignments (but students may reuse bits and pieces of the assignments). The paper should have an abstract, introduction, conclusion and bibliography. The rest of the paper should address the algorithm, the implementation in Java and the verification effort. The paper should be 15 pages. If necessary, the paper may be supplemented with appendices. The paper should be formatted according to Springer-Verlag Lecture Notes in Computer Science Series guidelines.

There are downloads available under the Creative Commons License license. Download Now

Include in RSS: 

For more complete information about compiler optimizations, see our Optimization Notice.