next up previous
Next: Some Reference Books for Up: Implementation-based Term Project Previous: Implementation-based Term Project

Due Dates:

Initial half-page writeup containing problem statement: Feb 11
Link to web site with writeup posted.
Bibliography and a brief description of your chosen algorithms: Feb 25
Have links to all online references on your web site.
Algorithm 1: March 11
Post all files - source codes, adequately documented, and timing data files.
Algorithm 2: Mar 25
Meld Algo 1 writeup with Algo 2 writeup and post - to become the Implementation paper.
Algorithm 3: Apr 8 Meld the three writeups and post.
Implemenatation paper: Apr 15
Organized, polished and updated.

With each algorithm, submit (and post) the following:

  1. A 1-2 page description (hard copy) of
    1. your problem,
    2. chosen algorithm,
    3. associated data structures,
    4. underlying communication pattern for PVM/MPI program,
    5. amount of read and write contention and synchronization overheads for the shared memory for shared-memory program,
    6. parallel time complexity for each implementation with a break down of communication/synchronization time and of computation time,
    7. timing experiment details (description of what parameters have been varied in what range, and how many runs have used for performance data),
    8. performance of each program with reference to the plots for (a) execution time and for (b) speedup as number of processes varies, and
    9. your conclusions containing your interpretation of the performance of these programs, their limitations, and possible future improvements.


next up previous
Next: Some Reference Books for Up: Implementation-based Term Project Previous: Implementation-based Term Project
Sushil_Prasad 2015-01-26