| |
|
Parallel Algorithms (Carnegie Mellon)
|
|
Material Type:
|
Course Module for Instructor-Lead Course
|
|
|
Technical Format:
|
PDF, Lab Instructions, Source Codes
|
|
Location :
|
Go to Material
|
|
Date added:
|
July, 2009
|
|
Date Modified:
|
July, 2009
|
| Author:
|
Guy Blelloch, Carnegie Mellon University
|
Description:
In this course students will learn about parallel algorithms. The emphasis will be on algorithms that can be used on shared-memory parallel machines such as multicore architectures. The course will include both a theoretical component and a programming component. Topics to be covered include: modeling the cost of parallel algorithms, lower-bounds, and parallel algorithms for sorting, graphs, computational geometry, and string operations. The programming language component will include data-parallelism, threads, futures, scheduling, synchronization types, transactional memory, and message passing.
|
|
Recommended Audience
|
Undergraduate Students
|
|
Language:
|
English
|
| |
