Parallel Algorithms ((3))

Catalog description

This is an advanced graduate course in the design and analysis of algorithms for parallel systems. Theoretical topics include modeling the cost of parallel algorithms, and parallel algorithms for sorting, trees, graphs, and computational geometry. Practical topics will include data-parallelism, threads, futures, scheduling, synchronization, transactional memory and message passing. Students will design and present a project on parallel algorithms. Each week lecture meets for 150 minutes.