<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Bankers-Algorithm on Rafiul Alam</title>
    <link>https://alamrafiul.com/tags/bankers-algorithm/</link>
    <description>Recent content in Bankers-Algorithm on Rafiul Alam</description>
    <image>
      <title>Rafiul Alam</title>
      <url>https://alamrafiul.com/papermod-cover.png</url>
      <link>https://alamrafiul.com/papermod-cover.png</link>
    </image>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <lastBuildDate>Tue, 18 Nov 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://alamrafiul.com/tags/bankers-algorithm/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Banker&#39;s Algorithm: Deadlock Avoidance Through Safe State Detection</title>
      <link>https://alamrafiul.com/blogs/bankers-algorithm/</link>
      <pubDate>Tue, 18 Nov 2025 00:00:00 +0000</pubDate>
      
      <guid>https://alamrafiul.com/blogs/bankers-algorithm/</guid>
      <description>&lt;h2 id=&#34;the-bankers-algorithm&#34;&gt;The Banker&amp;rsquo;s Algorithm&lt;/h2&gt;
&lt;p&gt;The Banker&amp;rsquo;s Algorithm is a deadlock avoidance algorithm developed by Edsger Dijkstra in 1965. It models a bank that has limited cash and customers with credit limits who request loans in chunks. The bank only grants loans if the system stays in a &amp;ldquo;safe state&amp;rdquo; - meaning it can fulfill all future maximum requests.&lt;/p&gt;
&lt;h2 id=&#34;the-scenario&#34;&gt;The Scenario&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;A bank has:&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Limited cash available&lt;/li&gt;
&lt;li&gt;Multiple customers with credit limits&lt;/li&gt;
&lt;li&gt;Customers request loans in chunks over time&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;The rules:&lt;/strong&gt;&lt;/p&gt;</description>
    </item>
    
  </channel>
</rss>
