Compare Proposal

Nothing to compare.

Deadlock Avoidance with EDF plus SJF-Tie-Breaker Scheduling and EDZL plus LJF-Tie-Breaker Scheduling

  • Posted at : 1 year ago
  • Post Similar Project

Skills Required

Posted By -


Projects Posted : 2
Projects Paid : 0
Services Purchased : 0
Total Spent :
Feedbacks : 0 %

Project Details show (+) hide (-)

In this assignment, you will implement a deadlock avoidance algorithm as part of the Process Manager to avoid deadlocks in a Unix/Linux system. Part of the assignment requires the manipulation
of Unix/Linux processes and part of it consists of simulation.
Both the deadlock-handling process and the processes requesting resources are real Unix/Linux
processes created using fork(). However, you do not need to actually allocate any resource. The
main process executes the Banker’s algorithm. The resource-requesting processes are required
to make requests by communicating with the deadlock-handling process with Unix/Linux shared
memory controlled by Unix/Linux semaphores.
The deadlock-handling process chooses the next process with a resource request having the
nearest absolute deadline to be serviced. Ties are broken in favor of the process with the shortest
remaining execution time (Shortest Job First - SJF). After having one request serviced, a process
has to allow another process to make a request before making another one, that is, another process
with the nearest absolute deadline is chosen for service. A process can also release resources during
its execution, and releases all resources held when it terminates.
Associated with each process is also a relative deadline (that is, the deadline from the current
time instant). One time unit is needed for servicing each request (whether the resource is allocated
or not), so the relative deadline for each process is decreased by 1 whether it is serviced or not. If
the resource is allocated for a request, then the computation time of this process decreases by 1;
otherwise, the computation time remains the same. If a process misses its deadline, keep servicing
its requests but indicate the deadline miss in the output. A ‘release’ instruction also needs 1 unit
of computation time just like a request.
A ‘calculate’ instruction does not use resources and its computation time is indicated in parentheses. A ‘useresources’ instruction simulates the use of allocated resources and its computation
time is indicated in parentheses.