Preview

Term paper about deadlock

Powerful Essays
Open Document
Open Document
1423 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
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

You May Also Find These Documents Helpful

  • Better Essays

    Week 5 Pos 355

    • 2010 Words
    • 9 Pages

    Operating systems were not in existence before the 1960s. The definition of operating systems is a program designed to run other programs on the computer and is the most important program. In the past, computers were built to execute a series of single task similar to a calculator. In the 1960s came the MCP (Master Control Program) for the B5000 mainframe computer created by the company Burroughs/Unisys. The MCP was the first OS written exclusively in a high-level language. As the years progressed, OS giants were starting to form such as Windows, Linux, and Mac. In, this paper, these 3 tech OS giants will be examined thoroughly while covering memory management, process management, file management, and security.…

    • 2010 Words
    • 9 Pages
    Better Essays
  • Good Essays

    Sharing allows several processes to access the same portion of main memory (Stallings, 2012). When there are a number of processes executing the same program it is beneficial to allow each process to access the same copy of the program rather than have its own separate copy (Stallings, 2012,). The memory management system must therefore…

    • 573 Words
    • 3 Pages
    Good Essays
  • Good Essays

    References: Stallings, W. (2012). Operating systems: Internals and design principles (7th ed.). Boston, MA: Prentice Hall.…

    • 392 Words
    • 2 Pages
    Good Essays
  • Good Essays

    When it comes to the program and how it relates to the computer processing and memory usage, the program will typically be stored in non-volatile memory until it is requested. Upon request it will then be loaded into random access memory (RAM). Once it is loaded into the RAM it then can be accessed by the central processing unit (CPU). It will then execute instructions until terminated. Termination can either be by user or it can be due to software or hardware error.…

    • 575 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Explain why Solaris, Windows XP, and Linux implement multiple locking mechanisms. Describe the circumstances under which they use spinlocks, mutexes, semaphores, adaptive mutexes, and condition variables.…

    • 948 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    This assignment verifies that you understand how shared and exclusive locks work. Suppose that S1, S2, and S3 are sessions connected concurrently to the same database instance. Suppose further that D1, D2, and D3 are data objects that can be locked with a shared and exclusive lock. For the ten locking situations below, indicate, for each session, whether it procures the requested lock, waits, or deadlocks.…

    • 679 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    This assignment verifies that you understand how shared and exclusive locks work. Suppose that S1, S2, and S3 are sessions connected concurrently to the same database instance. Suppose further that D1, D2, and D3 are data objects that can be locked with a shared and exclusive lock. For the ten locking situations below, indicate, for each session, whether it procures the requested lock, waits, or deadlocks.…

    • 440 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Concurrency

    • 515 Words
    • 3 Pages

    To ensures that correct results for concurrent operations are generated, while getting those results as quickly as possible. Simultaneous execution of transactions over a shared database can create several data integrity and consistency problems: - Lost Updates. - Uncommitted Data. - Inconsistent retrievals.…

    • 515 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Deadlock

    • 779 Words
    • 4 Pages

    In an operating system, a deadlock is a situation which occurs when a process or thread enters a waiting state because a resource requested by it 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.…

    • 779 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Deadlock

    • 1203 Words
    • 5 Pages

    Deadlock occurs when each process in a set is waiting for an event that can only be caused by some other process in that set. Basically, deadlock is an operating system issue that reared its head with the advent of multiprogramming environments. First and foremost, a deadlock cannot occur unless there are at least two processes trying to run concurrently. There are actually four distinct circumstances that must be met for deadlock to occur, which will be discussed shortly, but it is worth noting that it is fundamentally a multiprocessing problem. Mono-processing systems do not have to worry about deadlock. The reason is that deadlock involves resource allocation, and if there is only one process, it has uncontested access to all resources. Only certain types of resources are associated with deadlock, and they are of the exclusive-use, non-preemptible type. That is to say, only one process can use the resource at any given time, and once allocated the resource cannot be unallocated by the operating system, but rather the process has control over the resource until it completes its task. Excellent examples of such resources are printers, plotters, tape drives, etc.. Resources that do not fit the criteria are memory and the CPU. While it is convenient to discuss deadlock in terms of hardware resources, there are software resources that are equally good candidates for deadlock, such as records in a data base system, slots in a process table, or spooling space. Hardware or software, all that matters is that the resources are non-preemptible and serially reusable.…

    • 1203 Words
    • 5 Pages
    Good Essays
  • Powerful Essays

    Windox Xp Case Study

    • 6130 Words
    • 25 Pages

    – – – – – – – – – – the history of DOS and Windows operating systems. the Windows XP architecture. the various Windows XP subsystems. asynchronous and deferred procedure calls. how user processes, the executive and the kernel interact. how Windows XP performs process, thread, memory and file management. the…

    • 6130 Words
    • 25 Pages
    Powerful Essays
  • Better Essays

    When many transactions take place at the same time, they are called concurrent transactions. Managing the execution of such transactions is called concurrency control. As you can imagine, concurrency control is especially important in a multiuser database environment.…

    • 2731 Words
    • 9 Pages
    Better Essays
  • Good Essays

    Deadlock

    • 1101 Words
    • 5 Pages

    execution are held by other jobs, which, in turn, are waiting for other resources to…

    • 1101 Words
    • 5 Pages
    Good Essays
  • Good Essays

    Cooperative multitasking is, for the most part, obsolete. In this method, each process periodically checks with the operating system to determine whether or not another program or process is in need of the CPU. Should this be the case, the currently running program will relinquish control to the operating system, which in turn assigns priority to the next program or process. The major downside to this type of processing is that each program may have a subjective view of the aforementioned "periodically". Thus, if another program is in immediate need of the CPU and the current program has not yet checked with the operating system to determine if it should halt, system resources are monopolized by whatever program is currently active. In this manner, should an error occur in the current program before it "checks in" with the OS, it may terminate as well as failing to relinquish control of the CPU, resulting in total OS failure. This was the case with older operating systems, most notably Windows 3.x.…

    • 363 Words
    • 1 Page
    Good Essays
  • Satisfactory Essays

    Deadlock

    • 426 Words
    • 2 Pages

    Deadlock blocks a set of processes that competes for system resources. This can be permanent unless the OS takes action, such as forcing one or more processes to backtrack. Deadlock may involve consumable or reusable resources. A reusable resource is one that is not depleted by use. A consumable resource is one that is destroyed when it is obtained by a process. There are three approaches to dealing with deadlock: prevention, detection, and avoidance. Prevention guarantees that deadlocks will not happen. Detection is required if the OS is willing to grant resource requests; the OS checks for deadlocks and takes action to break the deadlock. Avoidance involves the analysis of…

    • 426 Words
    • 2 Pages
    Satisfactory Essays

Related Topics