Concurrency in Daily Life: The Milk Run Saga
Too Much Milk
R
o
o
m
m
a
t
e
A
3
:
0
0
A
r
r
i
v
e
h
o
m
e
:
n
o
m
i
l
k
3
:
0
5
L
e
a
v
e
f
o
r
s
t
o
r
e
3
:
1
0
A
r
r
i
v
e
a
t
s
t
o
r
e
3
:
1
5
L
e
a
v
e
s
t
o
r
e
3
:
2
0
A
r
r
i
v
e
h
o
m
e
,
p
u
t
m
i
l
k
a
w
a
y
3
:
2
5
3
:
3
0
CS 140 Lecture Notes: Concurrency
Slide 1
Too Much Milk
R
o
o
m
m
a
t
e
A
3
:
0
0
A
r
r
i
v
e
h
o
m
e
:
n
o
m
i
l
k
3
:
0
5
L
e
a
v
e
f
o
r
s
t
o
r
e
3
:
1
0
A
r
r
i
v
e
a
t
s
t
o
r
e
3
:
1
5
L
e
a
v
e
s
t
o
r
e
3
:
2
0
A
r
r
i
v
e
h
o
m
e
,
p
u
t
m
i
l
k
a
w
a
y
3
:
2
5
3
:
3
0
R
o
o
m
m
a
t
e
B
A
r
r
i
v
e
h
o
m
e
:
n
o
m
i
l
k
L
e
a
v
e
f
o
r
s
t
o
r
e
A
r
r
i
v
e
a
t
s
t
o
r
e
L
e
a
v
e
s
t
o
r
e
A
r
r
i
v
e
h
o
m
e
:
t
o
o
m
u
c
h
m
i
l
k
!
CS 140 Lecture Notes: Concurrency
Slide 2
Computerized Milk Purchase
1
if (milk == 0) {2
if (note == 0) {3
note = 1;
4
buy_milk();
5
note = 0;
6
}
7
}
CS 140 Lecture Notes: Concurrency
Slide 3
Still Too Much Milk
T
h
r
e
a
d
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
}
T
h
r
e
a
d
B
:
if (milk == 0) {if (note == 0) {note = 1;
buy_milk();
note = 0;
}
}
CS 140 Lecture Notes: Concurrency
Slide 4
Second Attempt
T
h
r
e
a
d
A
:
1
if (note == 0) {2
if (milk == 0) {3
buy_milk();
4
}
5
note = 1;
6
}
T
h
r
e
a
d
B
:
1
if (note == 1) {2
if (milk == 0) {3
buy_milk();
4
}
5
note = 0;
6
}
CS 140 Lecture Notes: Concurrency
Slide 5
Third Attempt
T
h
r
e
a
d
A
:
1
noteA = 1;
2
if (noteB == 0) {3
if (milk == 0) {4
buy_milk();
5
}
6
}
7
noteA = 0;
T
h
r
e
a
d
B
:
1
noteB = 1;
2
if (noteA == 0) {3
if (milk == 0) {4
buy_milk();
5
}
6
}
7
noteB = 0;
CS 140 Lecture Notes: Concurrency
Slide 6
Fourth Attempt
T
h
r
e
a
d
A
:
1
noteA = 1;
2
if (noteB == 0) {3
if (milk == 0) {4
buy_milk();
5
}
6
}
7
noteA = 0;
T
h
r
e
a
d
B
:
1
noteB = 1;
2
while (noteA == 1) {3
// do nothing
4
}
5
if (milk == 0) {6
buy_milk();
7
}
8
noteB = 0;
CS 140 Lecture Notes: Concurrency
Slide 7
CS 140 Lecture Notes: Concurrency
Slide 8
Multiple threads of activity unfold as Roommate A and Roommate B experience a series of events involving a lack of milk, store visits, and automated purchasing attempts. The narrative traverses the comical mishaps and coordination challenges faced in everyday tasks, depicted with a touch of humor and threaded with the essence of concurrency. CS 140 lecture notes on concurrency further contextualize the scenarios in a technical light.
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.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
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.
E N D
Presentation Transcript
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 140 Lecture Notes: Concurrency Slide 1
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 140 Lecture Notes: Concurrency Slide 2
Computerized Milk Purchase 1 if (milk == 0) { 2 if (note == 0) { 3 note = 1; 4 buy_milk(); 5 note = 0; 6 } 7 } CS 140 Lecture Notes: Concurrency Slide 3
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 140 Lecture Notes: Concurrency Slide 4
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 140 Lecture Notes: Concurrency Slide 5
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 140 Lecture Notes: Concurrency Slide 6
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 140 Lecture Notes: Concurrency Slide 7
