Basics 3 Flashcards

1
Q

A set of processes is _________ when each process in the set is blocked awaiting an event that can only be triggered by another blocked process in the set.

A

deadlocked

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

With _________ only one process may use a resource at a time and no process may access a resource unit that has been allocated to another process.

A

mutual exclusion

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

A closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain is the condition of __________ .

A

circular wait

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

The fastest form of interprocess communication provided in UNIX is __________ .

A

shared memory

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

The __________ condition can be prevented by defining a linear ordering of resource types.

A

circular wait

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

A __________ is a software mechanism that informs a process of the occurrence of asynchronous events.

A

signal

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

_________ can be defined as the permanent blocking of a set of processes that either compete for system resources or communicate with each other.

A

Deadlock

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

Inspired by the concept of co-routines, a _________ is a circular buffer allowing two processes to communicate on the producer-consumer model.

A

pipe

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

Linux provides three types of semaphore facilities in the kernel: binary semaphores, counting semaphores, and __________ .

A

reader-writer semaphores

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