## TBD

# Parallel Computing

#### Location, Time

Instructor: Xuhao Chen

Office Hours: Time, Location

## Course Description

This course is a research-oriented course on algorithm engineering, which will cover both the theory and practice of algorithms and data structures. Students will learn about models of computation, algorithm design and analysis, and performance engineering of algorithm implementations. We will study the design and implementation of sequential, parallel, cache-efficient, external-memory, and write-efficient algorithms for fundamental problems in computing. Many of the principles of algorithm engineering will be illustrated in the context of parallel algorithms and graph problems. Students will read and present research papers, write paper reviews, complete assignments that involve both theory and implementation, participate in classroom discussions, and complete a semester-long research project. Class time will consist of lectures, student presentations, and group project meetings. This course is suitable for graduate students or advanced undergraduates. Mathematical maturity and familiarity with algorithm analysis and performance engineering will be assumed.

### Prerequisites

Students taking this course should be familiar with C programming.

Prior knowledge of computer architecture concepts such as data locality will be useful but not required.

### Grading

Grades for this course will be based on a series of 3-5 programming assignments.

### Textbook (Optional)

### Computing Resources

We will be using Amazon Web Services.