Deadlock Characteristics and Solutions
Project description
The below text is my research proposal ,so you might read it carefully to write the research within the proposed scope and expand the ideas within the given boundary.
====================================================
Deadlock is an action that happens when a processor starts a waiting state because a resource requested is being called by another waiting processor, which in turn is waiting for another resource. If a processor is not able to change its situation indefinitely because another waiting processor is using the resources requested by the first one, then the system is in a deadlock.
The paper will illustrate several methods that can deal with deadlock efficiently. Although, it is believed that old fashion systems do ignoring the deadlock. However, most of the modern systems deal with such problem in several approaches to minimize the effects of deadlocks. One of the basic approach is to prevent this issue by eliminating one of the four conditions** that are essential to achieve deadlocks.
The second method to deal with deadlocks is avoidance of deadlock by using one of the following methods: safe state, resource allocation algorithm, and banker’s algorithm. As a part of this research we will provide a software for banker’s algorithm which is used to test for safety by simulating the allocation of predetermined maximum possible amounts of all resources.
**the four necessary Conditions: There are four conditions that are necessary to achieve deadlock:
Mutual Exclusion
Hold and Wait
No preemption
Circular Wait
2. Resource-Allocation Graph
if the four conditions happen, it achieve deadlock.
PLACE THIS ORDER OR A SIMILAR ORDER WITH US TODAY AND GET AN AMAZING DISCOUNT 🙂