Term Projects for CS612

Projects are usually done by teams of two students and are designed to give you an idea of what is like to do research in the area of compilers and high-performance computing. Towards this end, you and your partner are expected to complete of  "typical" research activities. These include,

• picking a partner that you can work with,
• meeting with your project supervisor at least once a week.
• doing background reading on the topic,
• designed novel algorithms or systems to solve the problem,
• building an prototype implementation of the system,
• presenting your work and results to the class,
• writing and submit a report about your activities, and
• developing a web page that describes your work.

Project Descriptions

You and your partner may choose what you do for your project. Here are a number of ideas that you might find interesting,

1. Transforming Iterative Algorithms to Block Recursive Codes [???]
2. A Comparison of Model-based and Empirical Optimization in FFTW [???]
3. Combining Model-based and Empirical Optimization [Mehmet & David, Hubert and Frances]
4. Application-level Checkpointing Protocols for Shared Memory [Shafat, Meetesh, and Pete]
5. Smart Data Layout for Incremental Checkpointing  [Milind & Ross]
6. Design your own project [Junhwan Kim]

Project Deadlines

• 3/14/03 -- Signup for a project with Paul Stodghill.
• Class presentation will be done during the second half of the course.
• 5/1/03 -- Turn in your final reports and implementations.

Presentation Dates

You will be expected to present your project and your results during the last few classes. There will be two presentations per lecture. Look on the last few lectures on this page to see what slots are still available.