Presentation is loading. Please wait.

Presentation is loading. Please wait.

Homework Assignment #2 J. H. Wang Nov. 1, 2013. Homework #2 Chap.5: 5.8, 5.19, 5.22 Chap.6: 6.11, 6.12, *6.35 (Optional: End-of-chapter project for Chap.

Published byHugh Mathews Modified over 9 years ago

Similar presentations

Presentation on theme: "Homework Assignment #2 J. H. Wang Nov. 1, 2013. Homework #2 Chap.5: 5.8, 5.19, 5.22 Chap.6: 6.11, 6.12, *6.35 (Optional: End-of-chapter project for Chap."— Presentation transcript:

1 Homework Assignment #2 J. H. Wang Nov. 1, 2013

2 Homework #2 Chap.5: 5.8, 5.19, 5.22 Chap.6: 6.11, 6.12, *6.35 (Optional: End-of-chapter project for Chap. 6) Due: two weeks (Nov. 15, 2013)

3 Optional End-of-Chapter Programming Projects Programming Projects for Chap. 6: –Project 1: The Sleeping Teaching Assistant Room: 1 desk with a chair and computer Hallway: 3 chairs POSIX threads, mutex locks, and semaphores –Project 2: The Dining Philosophers Problem Pthread mutex locks and condition variables –Project 3: Producer-Consumer Problem Producer and consumer threads Pthreads mutex locks/semaphores Windows mutex locks/semaphores

4 Any Question or Comments?

Download ppt "Homework Assignment #2 J. H. Wang Nov. 1, 2013. Homework #2 Chap.5: 5.8, 5.19, 5.22 Chap.6: 6.11, 6.12, *6.35 (Optional: End-of-chapter project for Chap."

Similar presentations

1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.

1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.
Operating Systems Mehdi Naghavi Winter 1385.

Operating Systems Mehdi Naghavi Winter 1385.
CS 471 - Lecture 4 Programming with Posix Threads and Java Threads George Mason University Fall 2009.

CS Lecture 4 Programming with Posix Threads and Java Threads George Mason University Fall 2009.
CSEN5322 Quiz-5.

CSEN5322 Quiz-5.
Chapter 2 Processes and Threads

Chapter 2 Processes and Threads
Chapter 6: Process Synchronization

Chapter 6: Process Synchronization
My bedroom My bedroom is big. The bed is opposite the wordrobe. My desk is next to the window. My computer is on the desk. There’s a stereo on the desk.

My bedroom My bedroom is big. The bed is opposite the wordrobe. My desk is next to the window. My computer is on the desk. There’s a stereo on the desk.
Cpr E 308 Spring 2004 Recap for Midterm Introductory Material What belongs in the OS, what doesn’t? Basic Understanding of Hardware, Memory Hierarchy.

Cpr E 308 Spring 2004 Recap for Midterm Introductory Material What belongs in the OS, what doesn’t? Basic Understanding of Hardware, Memory Hierarchy.
Monitors A high-level abstraction that provides a convenient and effective mechanism for process synchronization Only one process may be active within.

Monitors A high-level abstraction that provides a convenient and effective mechanism for process synchronization Only one process may be active within.
1 CS318 Project #3 Preemptive Kernel. 2 Continuing from Project 2 Project 2 involved: Context Switch Stack Manipulation Saving State Moving between threads,

1 CS318 Project #3 Preemptive Kernel. 2 Continuing from Project 2 Project 2 involved: Context Switch Stack Manipulation Saving State Moving between threads,
Concurrency: Deadlock and Starvation Chapter 6. Revision Describe three necessary conditions for deadlock Which condition is the result of the three necessary.

Concurrency: Deadlock and Starvation Chapter 6. Revision Describe three necessary conditions for deadlock Which condition is the result of the three necessary.
Semaphores, mutexes and condition variables. semaphores Two types – Binary – 0 or 1 – Counting 0 to n Wait – decrements > 0 forces a wait Post or signal.

Semaphores, mutexes and condition variables. semaphores Two types – Binary – 0 or 1 – Counting 0 to n Wait – decrements > 0 forces a wait Post or signal.
CS 3013 & CS 502 Summer 2006 Week 1 Review and Class Discussion 1 Review (last week) Three important terms Abstraction Concurrency Resource Critical Sections.

CS 3013 & CS 502 Summer 2006 Week 1 Review and Class Discussion 1 Review (last week) Three important terms Abstraction Concurrency Resource Critical Sections.
[d] – desk, dining room, door; [b] – bed, bedroom, bathroom; [s] – sofa, poster, sweep; [w] – wall, window, wardrobe.

[d] – desk, dining room, door; [b] – bed, bedroom, bathroom; [s] – sofa, poster, sweep; [w] – wall, window, wardrobe.
18/02/08Week 21 CENG334 Introduction to Operating Systems Erol Sahin Dept of Computer Eng. Middle East Technical University Ankara, TURKEY URL:

18/02/08Week 21 CENG334 Introduction to Operating Systems Erol Sahin Dept of Computer Eng. Middle East Technical University Ankara, TURKEY URL:
159.3351 More Synchronisation Last time: bounded buffer, readers-writers, dining philosophers Today: sleeping barber, monitors.

More Synchronisation Last time: bounded buffer, readers-writers, dining philosophers Today: sleeping barber, monitors.
Multithreaded Web Server.

Multithreaded Web Server.
Semaphores and Bounded Buffer Andy Wang Operating Systems COP 4610 / CGS 5765.

Semaphores and Bounded Buffer Andy Wang Operating Systems COP 4610 / CGS 5765.
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 2 Processes and Threads Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall,

MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 2 Processes and Threads Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall,
Operating Systems CMPSC 473 Mutual Exclusion Lecture 14: October 14, 2010 Instructor: Bhuvan Urgaonkar.

Operating Systems CMPSC 473 Mutual Exclusion Lecture 14: October 14, 2010 Instructor: Bhuvan Urgaonkar.

Similar presentations

Ads by Google