ICS 643 Spring 2022 General Course Information

Instructor

Nodari Sitchinava

• Office: POST 309C

• Email: nodari@hawaii.edu (Put “ICS 643” in the subject line)

• Office Hours: Tuesdays 10-11am (ICS 443), 11am-noon (ICS 643) on Zoom

Time & Location

All lectures will take place over Zoom on Mondays and Wednesdays 9:00am-10:15am. The Zoom link and password will be posted in Laulima.

Prerequisites

• An undergraduate course in algorithms (ICS 311 or equivalent) with a minimum grade of B

This is a course on advanced algorithmic concepts, so you should be very comfortable with asymptotic notation, analysis of algorithm runtimes (especially recursive algorithms), proof of correctness (especially proofs by induction) and the data structures and algorithms taught in an undergraduate algorithms course (most of the material from the CLRS textbook) . If you have taken an algorithms course outside of the UH system, email me with a brief description of the algorithms course(s) that you have taken (a link to the course webpage is a plus) and I'll provide you with an override to register for the course.

Student Learning Outcomes (SLOs)

At the end of this class, a successful student will be able to:

• apply parallel algorithm design techniques to solve fundamental computational problems

• prove correctness of a parallel algorithm

• analyze performace characteristics of a parallel algorithm

• design efficient parallel algorithms to solve computational problems of their choice

Reading Material

There is no required textbook, however, majority of the material will be from the following textbook:

• Joseph JáJá, Introduction to Parallel Algorithms. Addison Wesley, 1992. ISBN: 9780201548563.

The above textbook is placed on reserve at the Hamilton Library Circulation Desk and can be checked out for up to 2 hours at a time (use the call number “QA76.58 .J35 1992” to request it). For more information on course reserves please see this link.

The following manuscript is also a good introduction to parallel algorithms:

• Parallel Algorithms by Guy Blelloch and Bruce Maggs. From Computer Science Handbook, Second Edition, Allen B. Tucker (Editor).

You might also want to consider the following book for additional reading on more advanced concepts:

• John H. Reif, Synthesis of Parallel Algorithms, Morgan Kaufmann, 1993.