|
|
| |
| Deadlock Avoidance Strategy in Concurrent Processing |
Khin Po, May Thu Naing
|
Abstract:
Deadlock can be defined as the permanent blocking of a set of processes. This processes are either competes for the system resources or communicate with each other. All deadlocks involve conflicting needs for resources by two or more processes. The most common example of deadlock is the traffic deadlock. The blockage is permanent unless the OS takes some extraordinary action, such as killing me or more processes or forcing one or more processes to backtrack. There are three general approaches to dealing with the deadlock: prevention, detection and avoidance. This paper presents the banker's algorithm that used in deadlock avoidance strategy.
|
|
|
| | |