Lab Report Banker in Bangladesh Dhaka –Free Word Template Download with AI
Abstract
This Lab Report details the experimental implementation and analysis of Dijkstra’s Banker’s Algorithm within a simulated operating system environment. The specific objective is to evaluate deadlock avoidance strategies applicable to high-density computational environments, specifically mirroring the infrastructure challenges faced in Dhaka, Bangladesh. As Dhaka rapidly urbanizes with increasing demand for digital banking and cloud computing resources, the risk of resource starvation and system deadlocks becomes critical. This report demonstrates how the Banker’s Algorithm ensures safe state allocation for processes requesting finite resources such as memory (RAM) and CPU time slices.
In modern operating systems, deadlock is a critical failure mode where two or more processes are unable to proceed because each is waiting for the other to release a resource. While deadlock prevention requires imposing strict constraints on resource requests, deadlock avoidance allows resources to be allocated dynamically while ensuring that the system never enters an unsafe state.
The Banker’s Algorithm, named by Dijkstra after its inspiration from banking systems, serves as a robust algorithm for avoiding deadlocks. It operates on the principle that before granting a resource request, the operating system must simulate the allocation to determine if it leaves the system in a "safe state." If safe resources are available to satisfy at least one process in sequence until completion, then all processes can finish.
This lab focuses on adapting this theoretical algorithm to a practical scenario relevant to Bangladesh Dhaka. With Dhaka being the economic hub of Bangladesh and home to over 20 million people, the local banking sector and IT infrastructure are undergoing massive digital transformation. Ensuring that these systems remain available without crashing due to resource contention is paramount. This report documents the simulation of a multi-process system where resources are allocated according to predefined maximums, reflecting the constraints often seen in developing urban tech hubs.
2.1 Objectives
- To implement the Banker’s Algorithm in a programming environment (Python/C++).
- To simulate a system with multiple processes competing for limited resources.
- To verify that the system rejects requests leading to unsafe states.
- To contextualize findings within the infrastructure demands of Dhaka, Bangladesh.
2.2 System Parameters
The simulation models a resource pool typical of a mid-sized server cluster in a Dhaka-based data center. The resources modeled are:
- Total Available Resources (E):
- Type A (Memory Pages): 10 Units
- Type B (CPU Cycles): 5 Units
2.3 Initial State of Processes
We define five processes (P0 through P4), representing distinct banking transaction handlers in a Dhaka local bank system.
| Process | Affinity (Context) | Bangladesh Dhaka | - | -Preface: In the context of this lab, we treat "Banker" not merely as a financial institution but as the algorithmic logic used in Operating Systems to manage resources safely. | Max Need (Type A) | Max Need (Type B) |
|---|---|---|---|---|---|---|
| P0 | Retail Banking App | Simulating low-load morning transactions in Dhaka, Bangladesh. |
