Term paper about deadlock
Abstract
Operating system is a collection of software that manages computer hardware resources and provides common services for computer programs. In this term paper a thorough discussion of the drawbacks of, and the problems involved in, previous proposals to handle deadlocks in Operating system is provided. A deadlock is a situation which occurs when a process or thread enters a waiting state because a resource requested is being held by another waiting process, which in turn is waiting for another resource. If a process is unable to change its state indefinitely because the resources requested by it are being used by another waiting process, then the system is said to be in a deadlock. In a transaction database, a deadlock happens when two processes each within its own transaction updates two of information but in the opposite order. Several highlights of our proposals are emphasized.
Introduction
In Operating system, a deadlock is a situation in which two computer programs sharing the same resources are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function.
The earliest computer operating system ran only one program at a time. All the resources of the system were available to this one program. Later, operating system ran multiple programs at once, interleaving them. Programs were required to specify in advance what resources they needed so that they could avoid conflicts with other programs running at the same time. Eventually some operating system offered dynamic allocation of resources. Programs could request further allocations of resources after they had begun running. This led to the problem of the deadlock. For example, Program 1 requests resource A and receives it. Program 2 requests resource B and receives it. Program 1 requests resource B
Operating system is a collection of software that manages computer hardware resources and provides common services for computer programs. In this term paper a thorough discussion of the drawbacks of, and the problems involved in, previous proposals to handle deadlocks in Operating system is provided. A deadlock is a situation which occurs when a process or thread enters a waiting state because a resource requested is being held by another waiting process, which in turn is waiting for another resource. If a process is unable to change its state indefinitely because the resources requested by it are being used by another waiting process, then the system is said to be in a deadlock. In a transaction database, a deadlock happens when two processes each within its own transaction updates two of information but in the opposite order. Several highlights of our proposals are emphasized.
Introduction
In Operating system, a deadlock is a situation in which two computer programs sharing the same resources are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function.
The earliest computer operating system ran only one program at a time. All the resources of the system were available to this one program. Later, operating system ran multiple programs at once, interleaving them. Programs were required to specify in advance what resources they needed so that they could avoid conflicts with other programs running at the same time. Eventually some operating system offered dynamic allocation of resources. Programs could request further allocations of resources after they had begun running. This led to the problem of the deadlock. For example, Program 1 requests resource A and receives it. Program 2 requests resource B and receives it. Program 1 requests resource B