Define deadlock avoidance scheme.

Show the type of semaphores (choose incorrect one)

counting, general, strong weak

5. What is the monitor?

This combination allows for tight synchronization between processes.

Blocking send, blocking receive: Both the sender and receiver are blocked until the message is delivered; this is sometimes referred to as a rendezvous

7. What is atomic operation?

A sequence of one or more statements that appears to be indivisible; that is, no other process can see an intermediate state or interrupt the operation.

8. Atomic instructions

I. Compare

9. What is true about Multiprogramming and Multiprocessing

I. Multiprogramming is a management of multiple processes within a uniprocessor system.

II. Multiprocessing is a management of multiple processes within a multiprocessor.

III. Multiprogramming is the same as Multiprocessing

10. Permanent locking of a set of processes that either compete for system resources or communicate with each other.

Dedlock

11. Two general categories of resources.

12. What are the examples of reusable resources?

include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.

Define deadlock avoidance scheme.

A scheme that eliminates system deadlocks is called either a deadlock-prevention

scheme or a deadlock-avoidance scheme. Although the difference is not considered to

be essential, following the convention of [4] these schemes are distinguished as

follows: If such a scheme does not use any advance information about the resource

use of processes, it is called a deadlock-prevention scheme; otherwise, it is called a

deadlock-avoidance scheme.

14. Which condition is sufficient for a deadlock to actually take place (when 3 conditions are met)?

Prevention,avoidance,detection

15. What is the major advantage of deadlock detection?

16. What is the major disadvantage of deadlock detection?

Inherent preemption losses

Дата добавления: 2015-10-30