<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>OS | Ukant Jadia</title><link>https://ukantjadia.github.io/tag/os/</link><atom:link href="https://ukantjadia.github.io/tag/os/index.xml" rel="self" type="application/rss+xml"/><description>OS</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 21 Mar 2022 22:56:25 +0530</lastBuildDate><image><url>https://ukantjadia.github.io/media/icon_hu5e29e1df12b63ca0c9252c8db4842f1b_8915_512x512_fill_lanczos_center_3.png</url><title>OS</title><link>https://ukantjadia.github.io/tag/os/</link></image><item><title>Basics of Operating Sys</title><link>https://ukantjadia.github.io/post/basics-of-operating-sys/</link><pubDate>Mon, 21 Mar 2022 22:56:25 +0530</pubDate><guid>https://ukantjadia.github.io/post/basics-of-operating-sys/</guid><description>&lt;h1 id="1--operating-systemos">1. Operating System[OS]&lt;/h1>
&lt;img src="https://www.gatevidyalay.com/wp-content/uploads/2018/11/Translating-Logical-Address-into-Physical-Address-Diagram.png" alt="Example Image" width="300" height="200" align="right">
&lt;ol>
&lt;li>Paging :&amp;ndash;&amp;gt;&lt;/li>
&lt;/ol>
&lt;!-- ![IMAGE](https://www.gatevidyalay.com/wp-content/uploads/2018/11/Translating-Logical-Address-into-Physical-Address-Diagram.png) -->
&lt;ol>
&lt;li>it eleminates the need of contiguos memory allocation&lt;/li>
&lt;li>have two main component and parts&lt;/li>
&lt;li>component -&amp;gt; page number(p) and frame number(d)&lt;/li>
&lt;li>parts
+ Logical address -&amp;gt; addres generated by the CPU {represented in bits}
+ Physical address -&amp;gt; physical location of a required data in a memory&lt;/li>
&lt;li>In the process of accessing any data from memory, that will be done by accessing the memory location twice
to remove this double accessing of the memory we use the TLB{Translation Lockaside Buffer}.&lt;/li>
&lt;li>TLB &amp;ndash;&amp;gt; It contains the page table entries that have been most recently used. &lt;em>&lt;a href="https://media.geeksforgeeks.org/wp-content/uploads/20190225192626/tlb1.jpg" target="_blank" rel="noopener">IMAGE&lt;/a>&lt;/em>&lt;/li>
&lt;li>it is a kind of cache memory resister of memory with there physical address&lt;/li>
&lt;li>TLB stored the frequently used data for high speed accessing&lt;/li>
&lt;li>It consist of two parts
4. key or tag :: like page number
5. value :: like frame number&lt;/li>
&lt;li>It consist of few data that is { frequently/ recently used data}&lt;/li>
&lt;li>If data not found in the TLB table then it will search in the page table for that data {TLB miss}&lt;/li>
&lt;li>Advantages&lt;/li>
&lt;li>Disadvantages&lt;/li>
&lt;li>Terms
9. Hit Ratio{HR} &amp;ndash;&amp;gt; successful search / total searches doen
10. Miss Ratio{MR} &amp;ndash;&amp;gt; HR-total searches done
11. TLBT &amp;ndash;&amp;gt; Time( complete TLB search )
12. MAT &amp;ndash;&amp;gt; TIme( time to acces memory )
13. Effective Access Time
14. formula
EAT = HR*( TLBT + MAT ) + MR*( TLBT + 2*MAT)&lt;/li>
&lt;/ol></description></item></channel></rss>