CS 533 Parallel Computer Architectures
Spring 2006
Course Project Info
Project Midterm Reports due Mar 09 in class.
These are some guidelines for the CS533 midterm project report:
- About 8-10 pages
- Describe:
- Problem you are addressing
- How you solve it
- What you have done so far
- code
- machine
- algorithms
- results
- What you plan to do until the final report
Please note that the project midterm report is a non-neglible
part of your grade.
Simulator
SESC is a multiprocessor simulator that you can use for your projects. Enjoy it!
Project Proposals
Due Date: February 2
Format: One page with the title, names of the team members,
and explanation of what you want to do. Specify if you will
need accounts in a parallel machine, and if so, where?
General Topics:
- Study the lock contention in a machine
- Study a problem in the memory hierarchy of a machine
- Address trace generation study
- Operation systems problems
- Parallel simulation
- Effectiveness of an architectural feature in a parallel machine
- Interaction of compiler-architecture
- Interaction of OS-architecture
- Interaction of application-architecture
- Parallel applications (non-trivial ones only!)
Examples from SPRING 2005:
- Transient Fault Detection with Simultaneous Redundant Threads
- Thread-Level Speculation with Out-of-Order Spawn on a Simultaneous Multithreaded Processor
- Parallelizing Alpha-beta search for optimum performance
- Parallel Ray Tracing
- Implementation and Analysis of Adaptive Routing Strategies for Interconnection Networks on Massively Parallel Systems
- A Parallel Decoded for Ogg Vorbis
- Parallel Logic Simulation
- Implementation of a Charm++ Machine Layer on RDMA Over Ethernet
Examples from SPRING 2004:
- Data Locality Schemes for NUMA
- Parallelization of Security Algorithms
- A Parallel MP3 Decoder for Embedded Systems
- Development of a Linux Driver for Efficient I/O Rollback
- Parallel Genetic Algorithms
- Evaluation of Cache Coherence Protocol Traffic
- Support for Fault-Tolerance in an SMT Processor
Examples from SPRING 2002:
- Distributed Shared Memory Versus Message Passing on Clusters
- Parallel Game Tree Search Algorithms
- Developing and Evaluating Runtime Support for Heterogenous Dynamic Parallelization
- Parallelization of a Quantum Computing Simulator
- Performance of Speculative Locks on Shared Memory Multiprocessors
- Sphinx parallelization
- Parallel Chess
- Barnes Hut Parallelization
- Study of Scalable Directory-Based Cache COherence Schemes
- Fault Tolerant Cache COherence Protocol
- Checkpointing Strategies for Message Passing
- Adaptability of Protocols
- Optimizing collective communication
- Design and evaluation of resource sharing policies in SMTs