CS 670, Homework 6.
Due: Thursday, February 21 and Tuesday February 26
Points: 20 HW points.

(1)
Name: 

(2) List anyone that you talked to or worked with on your HW.  Remember
    to review the policy in the syllabus on collaborating on HW's.
Collaborators:

For this assignment, you will pick a topic/algorithm, learn about it, 
and present it to the class.  You should to talk to Jeff on Wednesday
about what you picked and what you plan to talk about.  You should 
be ready to present on Thursday.

Topic choices:
* Factoring algorithm(s) - Dixon's, quadratic sieve, or number field sieve.
  + Karthik and Chaitanya
* FFT multiplication - can we match GMP's multiplication speed?
  + Po-Ching
* Hadoop - distributed database, Ch. 9 in PPM.
* Parallel matrix operations - Ch. 12 in PPM.
  + Tsai-Chen
* Sorting in parallel - Ch. 13 in PPM.
  + Troy
* Parallel programming in Python - Ch. 16 in PPM (and appendix D as needed).
* R parallel programming - Ch. 10 in PPM (and appendix C as needed).
* Other topic - if you want to choose something else, present your case...

You can work in pairs or threes if you wish.

For each presentation, you should...
* Go through some example(s).
* Prepare some basic notes and links to more information.
* Have some bit of code that works.  I can help with this if needed.
* Give some little exercises for people to make sure they understand, 
  and an idea for a programming assignment.
* Come see me on Wednesday to talk about what you plan to do.