Notes - MIECT
Sistemas De Operação
Notes - MIECT
Sistemas De Operação
  • Sistemas de Operação
  • Processes in Unix/Linux
    • Process
    • Multiprocessing vs. Multiprogramming
    • Processes in Unix
    • Execution of a C/C++ program
  • Introduction to operating systems
    • Global view
    • Evolution of computational systems
    • Key topics
  • Semaphores and Shared memory
    • Concepts
    • Semaphores
    • Shared memory
    • Unix IPC primitives
  • Threads, mutexes and condition variables in Unix/Linux
    • Threads
      • In linux
    • Monitors
    • Unix IPC primitives
  • Processes
    • Process
      • Diagrams
    • Process control table
    • Context switching
    • Threads
  • Processor Scheduling
    • Processor Scheduler
    • Short-term processor scheduler
    • Scheduling algorithms
    • Scheduling criteria
    • Priorities
    • Scheduling policies
      • In Linux
  • Interprocess communication
    • Concepts
    • Philosopher dinner
    • Access primitives
      • Software solutions
      • Hardware solutions
    • Semaphores
    • Monitors
    • Message-passing
    • Unix IPC primitives
  • Deadlock
    • Introduction
    • Philosopher dinner - Solution 1
      • Deadlock prevention
    • Philosopher dinner - Solution 2
      • Deadlock prevention
    • Philosopher dinner - Solution 3
      • Deadlock prevention
    • Philosopher dinner - Solution 4
    • Deadlock avoidance
    • Deadlock detection
  • Memory management
    • Introduction
    • Address space
    • Contiguous memory allocation
    • Memory partitioning
    • Virtual memory system
    • Paging
    • Segmentation
    • Combining segmentation and paging
    • Page replacement
      • Policies
    • Working set
    • Thrashing
    • Demand paging vs. preparing
Powered by GitBook
On this page
  • Definition
  • Recover procedure
  • How?
  1. Deadlock

Deadlock detection

Definition

No deadlock-prevention or deadlock-avoidance is used.

  • So, deadlock situations may occur.

The state of the system should be examined to determine whether a deadlock has occurred.

A recover from deadlock procedure should exist and be applied.

What to do?

  • In a quite naive approach, the problem can simply be ignored.

  • Otherwise, the circular chain of processes and resources need to be broken.

Recover procedure

How?

  • release resources from a process – if it is possible

    • The process is suspended until the resource can be returned back.

    • Efficient but requires the possibility of saving the process state.

  • rollback – if the states of execution of the different processes is periodically saved.

    • A resource is released from a process, whose state of execution is rolled back to the time the resource was assigned to it.

  • kill processes

    • Radical but an easy to implement method.

PreviousDeadlock avoidanceNextIntroduction

Last updated 2 years ago