Computer Architecture Article 2022

Computer Architecture 1
Computer Organization and Architecture
By (Name)
The Name of the Class (Course)
Professor (Tutor)
The Name of the School (University)
The City and State where it is located
The Date

Computer Architecture 2
Computer Organization and Architecture
1) Handling and managing deadlocks
In computing technology, deadlocks happen when two or more processes compete for
resources. This usually happens when a resource needed by one program is held by another
program, and that resource cannot be released if certain requirements have not been met.
Deadlock detection, prevention and avoidance are used to handle such situations so that
processes do not wait for too long or even starve. Deadlock detection aims at detecting a
deadlock by using resource schedulers that track all resources being held by executing processes
(Furmans, et al., 2019). When a deadlock situation is detected, all processes involved in it are
killed and resources pre-empted from some processes and control handed over to others. With
deadlock prevention, a system evaluates each process before allowing it to enter into execution.
A process that can cause deadlock is never allowed to run into execution. Deadlock avoidance
works by avoiding any instances of deadlock situations rather than taking any precautionary
measures. Wait graphs showing relationships between processes and resources are used in this
case.
The present day microprocessor and CPU technologies that allow for multitasking
strategies. In such environments, the central processing unit is a resource that is shared among
different transactions with hardware clocks designed to ensure that no single process consumes
the CPU completely. This is a prevention mechanism whose goal is to ensure that the CPU can
adequately serve two or more processes simultaneously requesting for its control. The choice of
this mechanism is influenced by the fact that CPU is a critical infrastructure that must not be
allowed to ‘run’ out or be exhausted in its entirety. Any prevention algorithm that relies on

Computer Architecture 3
timestamps can be effectively used to avoid deadlock in CPU and ensure that no process is
unnecessarily killed/terminated or otherwise starved.
Deadlock avoidance mechanism works best with main memory (Ding, et al., 2010).
The strategy here is to ensure that only one job is requesting for a given memory space, and any
other job is kept in a waiting queue. The OS uses flags to indicate when given memory space that
is shared by some given processes are is dedicated for writing or reading. Processes waiting for
this space inspect these flags trusting that the space will be cleared before attempting to commit
their own changes in the spaces. The choice of this strategy influenced by the fact that several
programs need memory space and circular waits must always be avoided. To keep memory in
correct state, deadlock avoidance dynamically examines resource allocation against resource
requirements for all waiting processes.
Deadlock detection algorithms are best suited strategies to handle deadlocks in storage
memory spaces. Operating systems maintain a busy status of a device causing other programs to
hold-and-wait for a non-busy status. These algorithms help in distinguishing between gadgets
that need resources, and in the determination of whether the requested resources are free or not
so as to prevent deadlock from occurring.
Deadlock avoidance is the best suited strategy to handle deadlocks in files and file
management systems. The operating systems in this situation keeps up a status signal for a file
that is to be inspected by procedures and programs before they attempt to write on them. Where
operating system is not being used to monitor the system, a lock up state (usually in a mutual
document environment) is used and must be perused at the application level to determine the
correct status of a file or a record.