Concurrency: state models and design patterns Flashcards

1
Q

monitor

A

a monitor is a synchronization construct that allows threads to have both mutual exclusion and the ability to wait (block) for a certain condition to become true

Monitors also have a mechanism for signaling other threads that their condition has been met. A monitor consists of a mutex (lock) object and condition variables. A condition variable is basically a container of threads that are waiting for a certain condition. Monitors provide a mechanism for threads to temporarily give up exclusive access in order to wait for some condition to be met, before regaining exclusive access and resuming their task.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

model

A

an abstraction of the real world that makes it

easier to focus on the points of interest

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

FSP

A

finite state process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

LTS

A

labelled transition system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

state space

A

The state space of two composed processes is

(at most) the Cartesian product of the individual state spaces

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

monitor vs. lock

A

tbd

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

trace

A

the sequence of actions produced by the execution of a process (or set of processes)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

various kinds of liveness problems

A
  • Starvation (AKA “indefinite postponement”)
  • Dormancy
  • Premature termination
  • Deadlock
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

how to state liveness properties?

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Four necessary and sufficient conditions for deadlock

A
  • Serially reusable resources
  • Incremental acquisition
  • No pre-emption
  • Wait-for cycle
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

progress property

A

asserts that whatever state a system is in, it is always the case that a specified action will eventually be executed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Specialist Parallelism

A

t

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

flow architectures

A

t

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Software Architecture

A

t

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Layered

Architectures

A

t

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Blackboard Architectures

A

t

17
Q

result parallelism vs agenda

parallelism

A

t