Chapter 2 Processes and Threads 2 3 Interprocess

  • Slides: 23
Download presentation
Chapter 2 Processes and Threads 2. 3 Interprocess Communication

Chapter 2 Processes and Threads 2. 3 Interprocess Communication

Race Conditions Figure 2 -21. Two processes want to access shared memory at the

Race Conditions Figure 2 -21. Two processes want to access shared memory at the same time. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Critical Regions (1) Conditions required to avoid race condition: • • No two processes

Critical Regions (1) Conditions required to avoid race condition: • • No two processes may be simultaneously inside their critical regions. No assumptions may be made about speeds or the number of CPUs. No process running outside its critical region may block other processes. No process should have to wait forever to enter its critical region. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Critical Regions (2) Figure 2 -22. Mutual exclusion using critical regions. Tanenbaum, Modern Operating

Critical Regions (2) Figure 2 -22. Mutual exclusion using critical regions. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Mutual Exclusion with Busy Waiting Proposals for achieving mutual exclusion: • • • Disabling

Mutual Exclusion with Busy Waiting Proposals for achieving mutual exclusion: • • • Disabling interrupts Lock variables Strict alternation Peterson's solution The TSL instruction Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Strict Alternation Figure 2 -23. A proposed solution to the critical region problem. (a)

Strict Alternation Figure 2 -23. A proposed solution to the critical region problem. (a) Process 0. (b) Process 1. In both cases, be sure to note the semicolons terminating the while statements. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Peterson's Solution Figure 2 -24. Peterson’s solution for achieving mutual exclusion. Tanenbaum, Modern Operating

Peterson's Solution Figure 2 -24. Peterson’s solution for achieving mutual exclusion. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

The TSL Instruction (1) Figure 2 -25. Entering and leaving a critical region using

The TSL Instruction (1) Figure 2 -25. Entering and leaving a critical region using the TSL instruction. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

The TSL Instruction (2) Figure 2 -26. Entering and leaving a critical region using

The TSL Instruction (2) Figure 2 -26. Entering and leaving a critical region using the XCHG instruction. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

The Producer-Consumer Problem . . . Figure 2 -27. The producer-consumer problem with a

The Producer-Consumer Problem . . . Figure 2 -27. The producer-consumer problem with a fatal race condition. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Semaphores . . . Figure 2 -28. The producer-consumer problem using semaphores. Tanenbaum, Modern

Semaphores . . . Figure 2 -28. The producer-consumer problem using semaphores. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Mutexes Figure 2 -29. Implementation of mutex lock and mutex unlock. Tanenbaum, Modern Operating

Mutexes Figure 2 -29. Implementation of mutex lock and mutex unlock. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Mutexes in Pthreads (1) Figure 2 -30. Some of the Pthreads calls relating to

Mutexes in Pthreads (1) Figure 2 -30. Some of the Pthreads calls relating to mutexes. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Mutexes in Pthreads (2) Figure 2 -31. Some of the Pthreads calls relating to

Mutexes in Pthreads (2) Figure 2 -31. Some of the Pthreads calls relating to condition variables. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Mutexes in Pthreads (3) . . . Figure 2 -32. Using threads to solve

Mutexes in Pthreads (3) . . . Figure 2 -32. Using threads to solve the producer-consumer problem. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Monitors (1) Figure 2 -33. A monitor. Tanenbaum, Modern Operating Systems 3 e, (c)

Monitors (1) Figure 2 -33. A monitor. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Monitors (2) Figure 2 -34. An outline of the producer-consumer problem with monitors. Tanenbaum,

Monitors (2) Figure 2 -34. An outline of the producer-consumer problem with monitors. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Message Passing (1) . . . Figure 2 -35. A solution to the producer-consumer

Message Passing (1) . . . Figure 2 -35. A solution to the producer-consumer problem in Java. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

. . . Message Passing (2) . . . Figure 2 -35. A solution

. . . Message Passing (2) . . . Figure 2 -35. A solution to the producer-consumer problem in Java. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Message Passing (3). . . Figure 2 -35. A solution to the producer-consumer problem

Message Passing (3). . . Figure 2 -35. A solution to the producer-consumer problem in Java. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Producer-Consumer Problem with Message Passing (1) . . . Figure 2 -36. The producer-consumer

Producer-Consumer Problem with Message Passing (1) . . . Figure 2 -36. The producer-consumer problem with N messages. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

. . . Producer-Consumer Problem with Message Passing (2) Figure 2 -36. The producer-consumer

. . . Producer-Consumer Problem with Message Passing (2) Figure 2 -36. The producer-consumer problem with N messages. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Barriers Figure 2 -37. Use of a barrier. (a) Processes approaching a barrier. (b)

Barriers Figure 2 -37. Use of a barrier. (a) Processes approaching a barrier. (b) All processes but one blocked at the barrier. (c) When the last process arrives at the barrier, all of them are let through. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0 -13 - 6006639

Threads 1 Processes versus Threads 2 Why ThreadsThreads 1 Processes versus Threads 2 Why Threads
Chapter 3 PROCESSES THREADS Processes and Threads inChapter 3 PROCESSES THREADS Processes and Threads in
Chapter 2 Processes Threads Concurrency processes threads 1Chapter 2 Processes Threads Concurrency processes threads 1
Chapter 2 Processes Threads Concurrency processes threads 1Chapter 2 Processes Threads Concurrency processes threads 1
Interprocess Communication Interprocess Communication Processes within a systemInterprocess Communication Interprocess Communication Processes within a system
Processes and Interprocess Communication Announcements Processes Why ProcessesProcesses and Interprocess Communication Announcements Processes Why Processes
Processes and threads n n n Processes ThreadsProcesses and threads n n n Processes Threads
Threads vs Processes Hank Levy Processes and ThreadsThreads vs Processes Hank Levy Processes and Threads
Chapter 2 Processes Threads Part 2 Interprocess CommunicationChapter 2 Processes Threads Part 2 Interprocess Communication
Outline n n n Processes Threads Interprocess communicationOutline n n n Processes Threads Interprocess communication
Outline n n n Processes Threads Interprocess communicationOutline n n n Processes Threads Interprocess communication
Threads H two Threads main threads Jamaica FijiThreads H two Threads main threads Jamaica Fiji
Threads Threads Threads basics A thread is aThreads Threads Threads basics A thread is a
Threads n H two Threads main threads JamaicaThreads n H two Threads main threads Jamaica
JAVA THREADS Threads Overview Creating threads in JavaJAVA THREADS Threads Overview Creating threads in Java
Chapitre X threads Threads o Threads plusieurs activitsChapitre X threads Threads o Threads plusieurs activits
Cours du 312 Threads Threads o threads plusieursCours du 312 Threads Threads o threads plusieurs
Linux Interprocess Communication Interprocess Communication Like UNIX LinuxLinux Interprocess Communication Interprocess Communication Like UNIX Linux
OPERATING SYSTEM LESSON 6 INTERPROCESS COMMUNICATION INTERPROCESS COMMUNICATIONOPERATING SYSTEM LESSON 6 INTERPROCESS COMMUNICATION INTERPROCESS COMMUNICATION
Computer Systems InterProcess Communication via Sockets Interprocess CommunicationComputer Systems InterProcess Communication via Sockets Interprocess Communication
Interprocess Communication Interprocess communication Deadlocks Classic IPC ProblemsInterprocess Communication Interprocess communication Deadlocks Classic IPC Problems
Lab 6 Interprocess communication Signals Introduction Interprocess communicationLab 6 Interprocess communication Signals Introduction Interprocess communication