Main Page

Announcements
(Latest: September 9, 2009)

Lectures

Labs

Assignments &
Study Guides

Course Guidelines

Programs

Resources

Syllabus

Grading Policy

CS 361 Concurrent Programming

Course Description:
Covers programming of concurrent, cooperating sequential processes. Studies race conditions, critical sections, mutual exclusion, process synchronization, semaphores, monitors, message passing, the rendezvous, deadlock, and starvation. See syllabus for more details.

Prerequisites
CS260 Data Structures; CS281 and CS282 System Architecture I and II

Instructors
Section 501/701 - Bill Mongan

Office hours
Bill: M 4-5pm, and by appointment in UC 113
Xinyu Jia (xj24): TA: W 2-4pm, R 4-5pm, F 12-1pm in UC 147

Meeting Time
R 6-9PM in Korman 117

Course Web Pages
Section 601 - http://www.billmongan.com/cs361_fa09

Textbook

1. M. Ben-Ari, Principles of Concurrent and Distributed Programming, 2nd edition. Addison-Wesley, 2006.
2. Abraham Silberschatz, Peter Galvin and Greg Gagne, Operating System Concepts , Seventh Edition, Wiley and Sons Inc., 2005. ISBN: 0-471-69466-5.
3. Recommended: Brian Goetz, et al., Java: Concurrency in Practice. Addison Wesley, ISBN: 0321349601.
4. Recommended: Stephen J. Hartley, Concurrent Programming: The Java Programming Language, Oxford University Press, 1998, ISBN 0-19-511315-2.