CS388P: Parallel Algorithms (#54110), Fall 2013
of Texas at Austin
Department of Computer Sciences
August 28, 2013
Time and Place. MW 11-12:30, GDC 4.516
Professor. Vijaya Ramachandran
(vlr"at"cs), GDC 4.430, 471-9554.
Office Hours. MW 2-3.
Joseph JaJa. Introduction to Parallel Algorithms,
The textbook will be supplemented with other material as needed.
Prerequisites. Graduate standing, and a theory algorithms course such as undergraduate CS331 or graduate CS388G.
COURSE OUTLINE. This is a graduate diversity course in a theory thread . We will cover the following topics.
Introduction to parallel algorithms:
Time/work optimality; some basic results
Introduction to parallel models:
Distributed memory: networks; routing; BSP. Shared memory: Caching; multicores.
Efficient PRAM computations:
Prefix sums; merging; merge-sort; bitonic sort; list ranking; tree computations; graph connectivity; ear decomposition; lower bounds.
|Four to five weeks|
RNC, maximum matching; NC, Boolean circuit families; logspace, space complexity, parallel computation thesis; P-completeness.
Network, BSP, and multicore algorithms:
Randomized routing on hypercube; EREW emulation on BSP; multicore scheduling.
There is no programming component to the course.
Class Meetings. We will meet at the regularly scheduled class timings with the following exceptions.
Proposed Dates and Times for the 3 Tests.
Course Grade. The course agrade will be based on the following:
Scoring of Tests. The total of 70 points is distributed over the three tests as follows.
Blackboard/Canvas/Piazza. Course material will be posted on Piazza or Canvas (accessible through Blackboard through UTDirect).
Students with Disabilities. Students with disabilities may request appropriate academic accommodations from the Division of Diversity and Community Engagement, Services for Students with Disabilities, 471-6259, http://www.utexas.edu/diversity/ddce/ssd
If you require any assistance or accommodations from me, please let me know by September 13.
Accommodations for Religious Holidays. By UT Austin policy, you must notify the instructor of your pending absence at least fourteen days prior to the date of observance of a religious holy day. If you must miss a class or an examination in order to observe a religious holy day, you will be given an opportunity to complete the missed work within a reasonable time before or after the absence, provided proper notification is given.
If you intend to make use of such accommodations, please let me know by September 13.
Statement on Scholastic Dishonesty. Anyone who violates the rules for the problem sets or who cheats in the in-class tests or final exam is in danger of receiving an F for the course. Additional penalties may be levied by the Computer Sciences department and the University. See http://www.cs.utexas.edu/academics/conduct/
Course URL. http://www.cs.utexas.edu/~vlr/courses/f13.388p/index.html
A daily schedule will be available, and periodically updated, on the course schedule page: http://www.cs.utexas.edu/~vlr/courses/f13.388p/sched.html