def. Flashcards

(14 cards)

1
Q

CRITICAL SECTION

A

A section of code within a process that requires access to shared resources and that may not execute while another process is in a corresponding section of code.

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

DEADLOCK

A

A situation in which two or more process are unable to proceed because each is waiting for one of the others to do something.

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

what is indirect method of deadlock?

A

to prevent the occurrence of one of the three necessary conditions.
- Mutual Exclusion
- No Preemption
- Hold and Wait

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

what is a direct method of deadlock?

A

to prevent the occurrence of circular wait

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

HOLD AND WAIT

A

A process may hold allocated resources while awaiting assignments of others

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

Circuit Wait

A

A closed chain of process exist, such that each process holds at least one resource needed by the next process in the chain.

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

Mutual Exlusion

A

The requirement that when one process is in the critical section that accesses shared resources, no other process can the in the critical section that access any of those shared resources.

ONLY ONE PROCESS MAY USE THE RESOURCE AT A TIME.

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

NO PREEMPTION

A

No resource can be forcibly removed from the process holding it.

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

MULTI PROGRAMMING

A

The management of multiple processes within a uniprocessor system

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

MULTI PROCESSING

A

The management of multiple processes within a MULTI PROCESSOR

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

DISTRIBUTED PROCESSING

A

The management of multiple processes executing on multiple, distributed computer systems. The recent proliferation of clusters is a prime example of this system.

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

RACE CONDITION

A

A situation in which multiple threads or processes read and write a shared data item and the final result depends on the relative timing of their executin.

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

STARVATION

A

A situation in which a runnable process is overlooked indefinitely by the scheduler; although is is able to proceed, it is never chosen.

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