Anki Deck Changes

Note 1: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: K,fisLmPeW

added

New Note

Front

What's the problem with notification?

Back

What's the problem with notification?

No mutual exclusion!

Field-by-field Comparison

Field	Before	After
Front		What's the problem with notification?<br><br><img src="paste-f2d8f3beeaf6f48f730430087921c3e21aa59aca.jpg">
Back		No mutual exclusion!<br><br><img src="paste-a3df6d640733f683122a81d29a0d1ccafc0371bf.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::1._Mutual_Exclusion

Note 2: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: K>ug`7HTL`

added

New Note

Front

What's an issue of the Readers-Writers pattern?

Back

What's an issue of the Readers-Writers pattern?

The reader may not be reading at all times, causing input loss!

Field-by-field Comparison

Field	Before	After
Front		What's an issue of the Readers-Writers pattern?<br><br><img src="paste-5b1101e8375a8f6016a7b86991131d792b56304f.jpg">
Back		The reader may not be reading at all times, causing input loss!<br><br><img src="paste-48656cf3c97513bbb32ce7e85601825b7d136132.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::3._Readers-Writers

Note 3: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: M`z+&R0ZMn

added

New Note

Front

What's the problem with putting up flags first and then checking the neighbor?

Back

What's the problem with putting up flags first and then checking the neighbor?

We still have livelock and starvation!

Field-by-field Comparison

Field	Before	After
Front		What's the problem with putting up flags first and then checking the neighbor?<br><br><img src="paste-dc4d0a04c8aa3beea684219d0fbb54e515ee9fa4.jpg">
Back		We still have livelock and starvation!<br><br><img src="paste-4ee017b283384b29010f1bb07f97648b18e38481.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::1._Mutual_Exclusion

Note 4: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Cloze
GUID: N-`{p4Lt3o

added

New Note

Front

Parallel execution can introduce inefficiencies such as communication overhead, load imbalance, and idle time due to task dependencies or waiting for data exchange.

Back

Parallel execution can introduce inefficiencies such as communication overhead, load imbalance, and idle time due to task dependencies or waiting for data exchange.

Field-by-field Comparison

Field	Before	After
Text		Parallel execution can introduce inefficiencies such as {{c1::communication overhead}}, {{c2::load imbalance}}, and {{c3::idle time due to task dependencies or waiting for data exchange}}.

Tags: ETH::2._Semester::PProg::01._Introduction

Note 5: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Cloze
GUID: NAqmdxn~W[

added

New Note

Front

Managing shared resources in parallel programming introduces challenges such as race conditions, synchronization, deadlock, livelock etc.

Back

Managing shared resources in parallel programming introduces challenges such as race conditions, synchronization, deadlock, livelock etc.

Field-by-field Comparison

Field	Before	After
Text		Managing shared resources in parallel programming introduces challenges such as {{c1::race conditions, synchronization, deadlock, livelock etc}}.

Tags: ETH::2._Semester::PProg::01._Introduction

Note 6: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: P%}^}]&H%f

added

New Note

Front

How can we solve starvation in the cat and dog problem?

Back

How can we solve starvation in the cat and dog problem?

Combine flags with a turn-based determinator!

Field-by-field Comparison

Field	Before	After
Front		How can we solve starvation in the cat and dog problem?
Back		Combine flags with a turn-based determinator!<br><br><img src="paste-a9b6f4d9dcd618ad0a26b4482f5356d49d20cd09.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::1._Mutual_Exclusion

Note 7: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Cloze
GUID: eIYu#!KzX_

added

New Note

Front

\(\text{speedup (using p processors)} = \frac{\text{execution time (using 1 processor)}}{\text{execution time (using p processors)}}\)

Back

\(\text{speedup (using p processors)} = \frac{\text{execution time (using 1 processor)}}{\text{execution time (using p processors)}}\)

Field-by-field Comparison

Field	Before	After
Text		\({{c1::\text{speedup (using p processors)}}} = \frac{{{c2::\text{execution time (using 1 processor)}}}}{{{c3::\text{execution time (using p processors)}}}}\)

Tags: ETH::2._Semester::PProg::01._Introduction

Note 8: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: g9lF(k!=m>

added

New Note

Front

Which problem remains here?

Back

Which problem remains here?

We still have the general problem of waiting!

Field-by-field Comparison

Field	Before	After
Front		Which problem remains here?<br><br><img src="paste-6e904e009756ec14d14e931788f4b772eea35049.jpg">
Back		We still have the general problem of waiting!<br><br><img src="paste-bdfff43e8373bcf39038c2c2d9a30b7aa110d962.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::1._Mutual_Exclusion

Note 9: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: g?g2.P+F4z

added

New Note

Front

What's one caveat of the producer-consumer pattern?

Back

What's one caveat of the producer-consumer pattern?

The order is not guaranteed!

Field-by-field Comparison

Field	Before	After
Front		What's one caveat of the producer-consumer pattern?<br><br><img src="paste-4aead4902f587a2bf7b8cbffb3972fca3d3a596b.jpg">
Back		The order is not guaranteed!<br><br><img src="paste-dbec8fb5ba0fa1863e35ee06d39eb8a6b41c6cd8.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::2._Producer-Consumer

Note 10: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Cloze
GUID: j_M%FT*ye3

added

New Note

Front

Parallel programming refers to dividing a problem into smaller tasks, which are processed at the same time on different computing resources to make the solution faster and more efficient.

Back

Parallel programming refers to dividing a problem into smaller tasks, which are processed at the same time on different computing resources to make the solution faster and more efficient.

Field-by-field Comparison

Field	Before	After
Text		{{c1::Parallel programming}} refers to dividing a problem into smaller tasks, which are processed at the same time on different computing resources to make the solution faster and more efficient.

Tags: ETH::2._Semester::PProg::01._Introduction

Note 11: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: k+S4n^4+Tx

added

New Note

Front

What's the problem with alternation?

Back

What's the problem with alternation?

Starvation!

Field-by-field Comparison

Field	Before	After
Front		What's the problem with alternation?<br><br><img src="paste-ad8f32e8d8a4867f60aff4aeab512e322c67fe76.jpg">
Back		Starvation!<br><br><img src="paste-ee8a99e1b3f8ca1b947a3f128452c2831a7ce5ef.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::1._Mutual_Exclusion

Note 12: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Cloze
GUID: n*pnVv+nib

added

New Note

Front

Access to shared resources needs synchronization.

Back

Access to shared resources needs synchronization.

Field-by-field Comparison

Field	Before	After
Text		Access to shared resources needs {{c1::synchronization}}.

Tags: ETH::2._Semester::PProg::01._Introduction::1._Mutual_Exclusion

Note 13: ETH::2. Semester::PProg

Deck: ETH::2. Semester::PProg
Note Type: Horvath Classic
GUID: q#;#HVzA)B

added

New Note

Front

Why does checking flags twice not work in the notification system?

Back

Why does checking flags twice not work in the notification system?

We could reach a deadlock!

Field-by-field Comparison

Field	Before	After
Front		Why does checking flags twice not work in the notification system?<br><br><img src="paste-11ce087816d909219d34a0506969277618d007da.jpg">
Back		We could reach a deadlock!<br><br><img src="paste-1efbb84fb9f56ed0de39e234d255f35cc07e9cf8.jpg">

Tags: ETH::2._Semester::PProg::01._Introduction::1._Mutual_Exclusion

Note 1: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 2: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 3: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 4: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 5: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 6: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 7: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 8: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 9: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 10: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 11: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 12: ETH::2. Semester::PProg

Previous

New Note

Front

Back

Note 13: ETH::2. Semester::PProg

Previous

New Note

Front

Back