Presentation is loading. Please wait.

Presentation is loading. Please wait.

While (lock = 1) wait Lock = 1 <critical section> Lock = 0 While (lock = 1) wait Lock = 1 <critical section> Lock = 0.

Published byLeony Tedjo Modified over 6 years ago

Similar presentations

Presentation on theme: "While (lock = 1) wait Lock = 1 <critical section> Lock = 0 While (lock = 1) wait Lock = 1 <critical section> Lock = 0."— Presentation transcript:

1

2 While (lock = 1) wait Lock = 1 <critical section> Lock = 0 While (lock = 1) wait Lock = 1 <critical section> Lock = 0

3 Loop1: While (turn != 1) wait <critical section> turn = 0 <noncritical section> GoToLoop1 Loop0: While (turn != 0) wait <critical section> turn = 1 <noncritical section> GoToLoop0

4 Interested[0]=T Turn = 0 [While (Turn = 0) and (Interested[1]=T) Wait] <critical section> Interested[0] = F Interested[1]=T Turn = 1 [While (Turn = 1) and (Interested[0]=T) Wait] <critical section> Interested[1] = F

5

Download ppt "While (lock = 1) wait Lock = 1 <critical section> Lock = 0 While (lock = 1) wait Lock = 1 <critical section> Lock = 0."

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 Part III: Process Management (Process Synchronization)

Operating Systems Part III: Process Management (Process Synchronization)
1 Statements. 2 Statements - 강의순서 ▣ 병행 (Concurrent) Statement ◈ Concurrent Signal Assignment, Simple ◈ Concurrent Signal Assignment, Conditional ◈ Concurrent.

1 Statements. 2 Statements - 강의순서 ▣ 병행 (Concurrent) Statement ◈ Concurrent Signal Assignment, Simple ◈ Concurrent Signal Assignment, Conditional ◈ Concurrent.
CSC321 Concurrent Programming: §3 The Mutual Exclusion Problem 1 Section 3 The Mutual Exclusion Problem.

CSC321 Concurrent Programming: §3 The Mutual Exclusion Problem 1 Section 3 The Mutual Exclusion Problem.
Process Synchronization Continued 7.2 The Critical-Section Problem.

Process Synchronization Continued 7.2 The Critical-Section Problem.
Previously… Processes –Process States –Context Switching –Process Queues Threads –Thread Mappings Scheduling –FCFS –SJF –Priority scheduling –Round Robin.

Previously… Processes –Process States –Context Switching –Process Queues Threads –Thread Mappings Scheduling –FCFS –SJF –Priority scheduling –Round Robin.
1 CENG334 Introduction to Operating Systems Erol Sahin Dept of Computer Eng. Middle East Technical University Ankara, TURKEY URL:

1 CENG334 Introduction to Operating Systems Erol Sahin Dept of Computer Eng. Middle East Technical University Ankara, TURKEY URL:
Interprocess Communication

Interprocess Communication
Chapter 3 The Critical Section Problem

Chapter 3 The Critical Section Problem
CIS 720 Mutual Exclusion. Critical Section problem Process i do (true) entry protocol; critical section; exit protocol; non-critical section od.

CIS 720 Mutual Exclusion. Critical Section problem Process i do (true) entry protocol; critical section; exit protocol; non-critical section od.
MAT 1221 Survey of Calculus Section 3.1 Increasing and Decreasing Functions

MAT 1221 Survey of Calculus Section 3.1 Increasing and Decreasing Functions
1 Operating Systems, 112 Practical Session 5, Synchronization 1.

1 Operating Systems, 112 Practical Session 5, Synchronization 1.
Enforcing Mutual Exclusion Message Passing. Peterson’s Algorithm for Processes P0 and P1 void P0() { while( true ) { flag[ 0 ] = false; /* remainder */

Enforcing Mutual Exclusion Message Passing. Peterson’s Algorithm for Processes P0 and P1 void P0() { while( true ) { flag[ 0 ] = false; /* remainder */
EEE 435 Principles of Operating Systems Interprocess Communication Pt I (Modern Operating Systems 2.3)

EEE 435 Principles of Operating Systems Interprocess Communication Pt I (Modern Operating Systems 2.3)
5.6 Semaphores Semaphores –Software construct that can be used to enforce mutual exclusion –Contains a protected variable Can be accessed only via wait.

5.6 Semaphores Semaphores –Software construct that can be used to enforce mutual exclusion –Contains a protected variable Can be accessed only via wait.
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,
Transaction Sen Zhang. Creating Transactions and Committing New Data Transaction: series of action queries that represent a logical unit of work User.

Transaction Sen Zhang. Creating Transactions and Committing New Data Transaction: series of action queries that represent a logical unit of work User.
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.
Section 2.6 Question 1. Section 2.6 Answer 1 Section 2.6 Question 2.

Section 2.6 Question 1. Section 2.6 Answer 1 Section 2.6 Question 2.
CS533 - Concepts of Operating Systems 1 CS533 Concepts of Operating Systems Class 8 Synchronization on Multiprocessors.

CS533 - Concepts of Operating Systems 1 CS533 Concepts of Operating Systems Class 8 Synchronization on Multiprocessors.

Similar presentations

Ads by Google