Deadlocks in operating systems

-

Deadlocks in operating systems


Deadlock Introduction


In a multiprogramming environment, several processes may compete for limited resources. When a process request resources and if resources are not available, then the process is going to be in the state of “wait state”. If the waiting state is not gonna change again since the resources are held by other waiting processes. 

It  situation is called as “Deadlock”.


Resources types:

  • CPU cycles
  • memory
  • I/O devices

Each process utilise the resources as follows:

  • Request
  • Use
  • Release

Deadlock Characterisation

  • Mutual exclusion : only one process at a time can use a resource
  • Hold and wait : A process holding at least one resource is waiting to acquire additional resources are held by other processes
  • No preemption : A process can be released only voluntarily by the process it holding it, after that process has completed it task
  • Circular wait : there exists a set of processes which are waiting for the resources circularly.

Methods for handling deadlocks


1.Ensure that the systems is never going to enter deadlock state

  • Deadlock prevention
  • Deadlock avoidance

2.Allow the system to have a deadlock state and recover


Ignore the problem and pretend that the deadlock never happens in the system.(used by the most operating systems)


Deadlock prevention


prevent the conditions which occur the have deadlocks

  • Mutual exclusion : not required for shareable resource(readonly); must hold for non-shareable resources
  • Hold and wait : must guarantee that whenever a process request a resource then it foes not hold another process
  • No preemption : process will be restarted only when it can regain its old resources.
  • Circular wait : impose a total ordering of all resources types. and required that each process requests resources in an increasing order of enumeration.

Deadlock avoidance 


the deadlock avoidance algorithm dynamically examines the resource-allocation state to ensure that there can never be a circular-wait condition.


Avoidance algorithms

  • single instance of a resource type : use a resource-allocation graph
  • multiple instance of a resource  type : use the banker’s algorithm

Comments

Post a Comment

Popular posts from this blog

How to push a file into a docker container

-
Let's  see how to push a file into the container from the host.  We are assuming the test.html file is the file we are going to copy into the docker container.  web-application is container docker cp test.html web-application:/folderpath we can verify  after log in to the container. docker exec -it web-application bash And then check in the folder path and you will see the file there copied Sources : https://www.linkedin.com/events/kubernetes-freetechnicalworksho6807993779836985344/
Read more

Docker - Begginer 1

-
Image
Docker What, Docker? Opensource platform tool  Manages the containers Allow to build applications in a container with the libraries, binaried and dependencies run from anywhere Why Docker? portability light weight OS fast delivery(impact of light weight os) Multiple isolated OS Resource optimization Continous development and testing Architecture Docker Client Docker Host  Docker Hub(Registery) Also Docker images , Docker containers , Dcker Network and storages are contains in the architecture. Docker client is used to communicate with Docker hosts using Docker daemon is installed in Docker host. Clients are used to manage the Docker components and operations such as create, delete, pull, push, bulid, run etc. Docker client can connect to the Docker host remotly using REST API, UNIX sockets or using a network interface. Docker hub(Registery) is used to pull and push Docker images There are two types of docker hubs Docker Hub Online/Docker Hub
Read more

Project(on going) - IPv6 Fragmentation

-
An IP Datagram travels over different networks, each of which may have different MTU (Maximum Transmit Unit ) , which is the largest IP datagram that can be carried by a network. MTU - - maximum size of an unit which can be transmitted in a network and it depends on the network and media and how they be allowed to transmitted. also encapsulation....etc. It happens when the MTU values of hosts and routers are different from each other;         When we have two different type of network/media connected with router which have different MTU in such case router broke down packet to appropriate size regarding network/media type payload exceed the Maximum Transmission Unit in the interface. so the payload has to be chopped and put them into IP fragmented packets. they are:     -reassembled at destination     -each fragment is independent datagram        - could be routed in a different direction        - could be delivered out of order        - can be used to bypass IPS       
Read more