Term projects will be presented in class for the last four class sessions. Your group is also responsible for a project report of 5-10 pages due on the last day of class. About one-third of your term project grade will be from your presentation and two-thirds will be from your project report.
For the final presentation, each group will have about 10-12 minutes times the number of students in your group to make your presentation, plus a few minutes for questions. All students in the group should participate actively in the presentation. Prepare PowerPoint® or other online presentation materials.
The Fall 2003 student projects are provided below.
| STUDENTS | PROPOSALS | FINAL PRESENTATIONS | FINAL PAPERS |
|---|---|---|---|
| Improving Cilk | |||
| Kunal Agrawal and Siddhartha Sen, “Adaptively Parallel Processor Allocation for Cilk Jobs” | (PDF) | (PDF) | (PDF) |
| Alexandru Caracas, “Fast Serial-Append File I/O Mode Support for Cilk” | (PDF) (Courtesy of Alexandru Caracas. Used with permission.) | (PDF) (Courtesy of Alexandru Caracas. Used with permission.) | (PDF) (Courtesy of Alexandru Caracas. Used with permission.) |
| Jason Hickey and Tyeler Quentmeyer, “A Space-Efficient Global Scheduler for Cilk” | (PDF) | (PDF) | (PDF) |
| Sajindra Jayasena and Sharad Ganesh, “Automatic Conversion of Non Series-Parallel DAGs to Series Parallel DAGs” | (PDF) (Courtesy of Sharad Ganesh and Sajindra Jayasena. Used with permission.) | (PDF) (Courtesy of Sharad Ganesh and Sajindra Jayasena. Used with permission.) | |
| Transactional Cilk | |||
| C. Scott Ananian, “Language-Level Complex Transactions” | (PDF) (Courtesy of C. Scott Ananian. Used with permission.) | (PDF) (Courtesy of C. Scott Ananian. Used with permission.) | |
| Sean Lie, “An Evaluation of Nested Concurrent Transactions” | (PDF) (Courtesy of Sean Lie. Used with permission.) | (PDF) (Courtesy of Sean Lie. Used with permission.) | (PDF) (Courtesy of Sean Lie. Used with permission.) |
| Jim Sukha, “Atomic Transactions in Cilk” | (PDF) (Courtesy of Jim Sukha. Used with permission.) | (PDF) | (PDF) (Courtesy of Jim Sukha. Used with permission.) |
| Xie Yong, “Transactions in Cilk” | (PDF)(Courtesy of Xie Yong. Used with permission.) | (PDF) (Courtesy of Xie Yong. Used with permission.) | (PDF) (Courtesy of Xie Yong. Used with permission.) |
| Non-Determinacy Detection | |||
| Jeremy Fineman, “Linear Time Detection of Determinacy Races” | (PDF) (Courtesy of Jeremy Fineman. Used with permission.) | (PDF) (Courtesy of Jeremy Fineman. Used with permission.) | (PDF) (Courtesy of Jeremy Fineman. Used with permission.) |
| He Yuxiong, “Parallel Nondeterminator” | |||
| Wang Junqing, “Parallel Nondeterminator” | (PDF) (Courtesy of Wang Junqing. Used with permission.) | (PDF) | |
| Using Cilk | |||
| Kenneth C. Barr, “Accelerating Multiprocessor Simulation” | |||
| Zardosht Kesheff, “Parallelizing METIS” | (PDF) (Courtesy of Zardosht Kasheff. Used with permission.) | (PDF) (Courtesy of Zardosht Kasheff. Used with permission.) | (PDF) (Courtesy of Zardosht Kasheff. Used with permission.) |
| Paul Youn, “Parallelizing Sorting” | |||
| Pham Duc Minh, “Implement FIR Filter in Parallel Using Cilk” | |||
| Cache-Oblivious Algorithms | |||
| Advait D.Karande and Sriram Saroop, “Cache-Oblivious Sorting for Burrows-Wheeler Transform” | (PDF) (Courtesy of Advait Karande and Sriram Saroop. Used with permission.) | (PDF) (Courtesy of Advait Karande and Sriram Saroop. Used with permission.) | (PDF) (Courtesy of Advait Karande and Sriram Saroop. Used with permission.) |
| Zhang Jiahui and Neel Kamal, “New Cache-Oblivious Algorithms” | (PDF) (Courtesy of Zhang Jiahu. Used with permission.) | ||
| Seth Gilbert, “Cache-Oblivious, Lock-Free Algorithms” | (PDF) (Courtesy of Seth Gilbert. Used with permission.) | (PDF) (Courtesy of Jeremy Fineman and Seth Gilbert. Used with permission.) | (PDF) (Courtesy of Seth Gilbert. Used with permission.) |
