CSCI 380 Project 2

This project has two parts. The first part is a group part, the second is solo. Fortunately, you can work on the parts in either order.

Part 1: Beowulf Cluster

Complete the assembly of your beowulf cluster with your group.

Part 2: Parallel Sorting

Implement a parallel sorting algorithm that will scale between 2 and 32 processors, sorting as many values as the user chooses. (You may use as many processes as you think necessary, of course.)

Scoring

Working beowulf: 30 points
Parallel algorithm for sorting that works correctly: 40 points
Documentation on how the algorithm scales as processors and data size increase: 20 points (varying on quality of information).
Speed competitiveness: 10 point (varying)
- integer only category
- all values category
Points awarded by dividing responses into five groups in each category. Fastest responses get full points, working down to 1 point for the slowest.

Due Date: 23:59 1 April 2008

Gary Lewandowski

Last modified: Mon Mar 24 17:32:15 EDT 2008