CSC 351 - Chapter 13 Flashcards
1
Q
Concurrency Occurance
A
- machine instruction level
- high level language statement level
- unit level
- program level
2
Q
Physical Concurrency
A
- multiple threads of control (All Independent)
3
Q
Logical Concurrency
A
- design as if there were multiple threads of control (appearance of physical concurrency using one processor)
4
Q
Thread of Control
A
- sequence of program points reached as control flows through a program
5
Q
Task/Process/Thread
A
- program unit that can be in concurrent execution with other program units
6
Q
Heavyweight Tasks
A
- execute in its own address space
7
Q
Lightweight Tasks
A
- run it the same address space
8
Q
Cooperation
A
- one task must wait for another task to complete some activity before it can continue executing
9
Q
Competition
A
- two or more tasks must use a resource that cannot be simultaneously used
10
Q
Liveness
A
- unit will eventually complete its execution
- concurrent tasks can easily lose its liveness
11
Q
Deadlock
A
- when all concurrent tasks lose their liveness
12
Q
Semaphore
A
- data structure that has a counter and a queue for storing task descriptors
- has two operations: wait and release
13
Q
Monitor
A
- abstract data type for shared data
