Herb Sutter and James Larus. Software and the Concurrency Revolution. Queue, 3(7):54-62, September 2005.

Celeste Biever. Chip revolution poses problems for programmers. New Scientist, 2594:26-27, March 2007.

Bryan Cantrill and Jeff Bonwick. Real-world concurrency. Communcations of the ACM, 51(11):34-39, November 2008.

Chapter 1 of

Mordechai Ben-Ari. Principles of Concurrent and Distributed Programming. Second edition. Addison-Wesley, Harlow, UK, 2006.

A guest lecture by librarian John Dupuis will take place in the Steacie Building, room 021. Ask at the library reference desk for room 021 if you cannot find it.

Leah Graham and Panagiotis Takis Metaxas. Of course it's true; I saw it on the Internet! Communications of the ACM, 46(5):70-75, May 2003.

Neil L. Waters. Why you can't cite Wikipedia in my class. Communications of the ACM, 50(9):15-17, September 2007.

P.J. Courtois, F. Heymans and D.L. Parnas. Concurrent control with "readers" and "writers". Communications of the ACM, 14(10): 667-668, October 1971.

Edsger W. Dijkstra. Two starvation-free solutions of a general exclusion problem. EWD 625.

No lecture and no office hours.

No lecture and no office hours.

No lecture and no office hours.

No lecture and no office hours.

A guest lecture by Susan Visser (Publishing Program Manager, IBM) will take place in the Computer Science and Engineering Building, room 3033.

C.A.R. Hoare. Monitors: an operating system structuring concept. Communications of the ACM, 17(10):549–557, October 1974.

Corrigenda

• Add count := count - 1 to the first remove procedure on page 553.
• Replace + with - in the release procedure on page 554.

Presentations of first assignment in the Computer Science and Engineering Building, room 2002.

C.A.R. Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666-677, August 1978.

Some sources (in alphabetical order) where you can find information about concurrent programming in Java:

• Mordechai Ben-Ari. Principles of Concurrent and Distributed Programming. Second edition. Addison-Wesley, Harlow, UK, 2006.
• Mary Campione, Kathy Walrath and Alison Huml. The Java Tutorial. Lesson: Threads: Doing Two or More Tasks At Once.
• Brian Goetz, Tim Peierls, Joshua Bloch, Joseph Bowbeer, David Holmes and Doug Lea. Java Concurrency in Practice. Addison-Wesley, 2006.
• James Gosling, Bill Joy, Guy L. Steele Jr. and Gilad Bracha. The Java Language Specification. Third edition.
• Charles W. Kann. Creating components: object oriented, concurrent, and distributed computing in Java. Auerbach, Boca Raton, FL, USA, 2004.
• Douglas Lea. Concurrent programming in Java : design principles and patterns. Second edition. Addison-Wesley, Reading, MA, USA, 2000.

If you come across another source that may be useful, please email it to the instructor.

Readers-writers problem in Java.

Consumer-producer problem in Java.

Lecture in room 3033 of the Computer Science and Engineering Building from 10:00 until 11:30.

R. Kent Treiber. System programming: coping with parallelism. Report RJ 5118. IBM Almaden Research Center, San Jose, CA, USA. April 1986.

Non-blocking stack in Java.

Communicating Sequential Processes for Java

Presentations of second assignment in the Computer Science and Engineering Building, room 3033.

Presentations of second assignment in the Computer Science and Engineering Building, room 2002.

A guest lecture by Nastaran Shafiei on Java PathFinder will take place in the Computer Science and Engineering Building, room 2002.

A guest lecture by Nastaran Shafiei on Java PathFinder will take place in the Computer Science and Engineering Building, room 2002.

Introduction to model checking.

Introduction to model checking.

Chapter 3 of
Brian Goetz, Tim Peierls, Joshua Bloch, Joseph Bowbeer, David Holmes and Doug Lea. Java Concurrency in Practice. Addison-Wesley, 2006.

Chapter 12 of
Brian Goetz, Tim Peierls, Joshua Bloch, Joseph Bowbeer, David Holmes and Doug Lea. Java Concurrency in Practice. Addison-Wesley, 2006.

Presentation of third assignment.

Presentations of third assignment.