Main Page

Announcements
(Latest: November 14, 2008)

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 601- Bill Mongan
Section 001 - Bruce Char

Office hours
Bill: Monday 11AM-2PM (in BCC TEC 211A) and anytime via e-mail or by appointment
Xinyu Jia (xj24): Off-campus TA/grader -- please email as needed or with questions

Meeting Time
Section 601 - TR 9:30AM-11AM in BCC TEC 209

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

Textbook

  1. Abraham Silberschatz, Peter Galvin and Greg Gagne, Operating System Concepts , Seventh Edition, Wiley and Sons Inc., 2005. ISBN: 0-471-69466-5.
  2. M. Ben-Ari, Principles of Concurrent and Distributed Programming, 2nd edition. Addison-Wesley, 2006.
  3. Recommended: Stephen J. Hartley, Concurrent Programming: The Java Programming Language, Oxford University Press, 1998, ISBN 0-19-511315-2.
Last edited: wmm24@cs.drexel.edu