Concurrency in Milk Management Scenario

The scenario explores a comical tale of roommates, A and B, dealing with the dilemma of milk shortages and excessive milk. Through a series of notes, images, and code snippets, the story unfolds as the roommates navigate buying and storing milk, with a touch of concurrency illustrated in their actions. The humorous narrative provides an entertaining perspective on handling milk-related challenges using programming concepts.

• Concurrency
• Milk Management
• Roommates
• Programming
• Humorous

artem Follow

Uploaded on Aug 24, 2024 | 0 Views

Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

Presentation Transcript

1. Too Much Milk Roommate A Arrive home: no milk Leave for store Arrive at store Leave store Arrive home, put milk away 3:00 3:05 3:10 3:15 3:20 3:25 3:30 CS 111 Lecture Notes: Concurrency Slide 1

2. Too Much Milk Roommate A Arrive home: no milk Leave for store Arrive at store Leave store Arrive home, put milk away Roommate B 3:00 3:05 3:10 3:15 3:20 3:25 3:30 Arrive home: no milk Leave for store Arrive at store Leave store Arrive home: too much milk! CS 111 Lecture Notes: Concurrency Slide 2

3. Computerized Milk Purchase 1 if (milk == 0) { 2 if (note == 0) { 3 note = 1; 4 buy_milk(); 5 note = 0; 6 } 7 } CS 111 Lecture Notes: Concurrency Slide 3

4. Still Too Much Milk Thread A: 1 if (milk == 0) { 2 if (note == 0) { 3 4 5 6 7 8 9 10 note = 1; 11 buy_milk(); 12 note = 0; 13 } 14 } Thread B: if (milk == 0) { if (note == 0) { note = 1; buy_milk(); note = 0; } } CS 111 Lecture Notes: Concurrency Slide 4

5. Second Attempt Thread A: 1 if (note == 0) { 2 if (milk == 0) { 3 buy_milk(); 4 } 5 note = 1; 6 } Thread B: 1 if (note == 1) { 2 if (milk == 0) { 3 buy_milk(); 4 } 5 note = 0; 6 } CS 111 Lecture Notes: Concurrency Slide 5

6. Third Attempt Thread A: 1 noteA = 1; 2 if (noteB == 0) { 3 if (milk == 0) { 4 buy_milk(); 5 } 6 } 7 noteA = 0; Thread B: 1 noteB = 1; 2 if (noteA == 0) { 3 if (milk == 0) { 4 buy_milk(); 5 } 6 } 7 noteB = 0; CS 111 Lecture Notes: Concurrency Slide 6

7. Fourth Attempt Thread A: 1 noteA = 1; 2 if (noteB == 0) { 3 if (milk == 0) { 4 buy_milk(); 5 } 6 } 7 noteA = 0; Thread B: 1 noteB = 1; 2 while (noteA == 1) { 3 // do nothing 4 } 5 if (milk == 0) { 6 buy_milk(); 7 } 8 noteB = 0; CS 111 Lecture Notes: Concurrency Slide 7

8. CS 111 Lecture Notes: Concurrency Slide 8