{"id":388,"date":"2024-06-28T12:59:23","date_gmt":"2024-06-28T12:59:23","guid":{"rendered":"https:\/\/study.madeeasy.in\/?p=388"},"modified":"2025-07-16T14:44:14","modified_gmt":"2025-07-16T09:14:14","slug":"what-is-logical-virtual-vs-physical-address-space","status":"publish","type":"post","link":"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-logical-virtual-vs-physical-address-space","title":{"rendered":"What is Logical (virtual) vs Physical Address Space?"},"content":{"rendered":"\r\n<p style=\"text-align: justify;\">The concept of a logical address space that is bound to a separate physical address space is central to proper memory management.<\/p>\r\n<ul style=\"text-align: justify;\">\r\n<li><strong>Logical address:<\/strong> Generated by the CPU; also referred to as virtual address.<\/li>\r\n<li><strong>Physical address:<\/strong> Address seen by the memory unit, i.e., the address loaded into MAR (memory address register).<\/li>\r\n<\/ul>\r\n<p style=\"text-align: justify;\">Logical and physical addresses are the same in compile-time and load-time address-binding schemes; logical (virtual) and physical addresses differ in execution-time address-binding scheme.<\/p>\r\n<p style=\"text-align: justify;\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-220 aligncenter\" src=\"http:\/\/study.madeeasy.in\/wp-content\/uploads\/2024\/06\/physical-address-space.png\" alt=\"physical-address-space\" width=\"253\" height=\"162\" \/><\/p>\r\n<h2 style=\"text-align: justify;\">WHAT IS MEMORY ALLOCATION TECHNIQUES?<\/h2>\r\n<p style=\"text-align: justify;\">Main memory is divided into a set of non-overlapping memory regions called partitions. Memory can be allocated in contiguous or non-contiguous partitions.<\/p>\r\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_79_1 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-light-blue ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-logical-virtual-vs-physical-address-space\/#Contiguous-Partition\" >Contiguous Partition<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-logical-virtual-vs-physical-address-space\/#1-Fixed-PartitionsStatic-Partitioning\" >1. Fixed Partitions\/Static Partitioning<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.madeeasy.in\/study\/cs-it\/operating-system\/what-is-logical-virtual-vs-physical-address-space\/#2-VariableDynamic-Partitioning\" >2. Variable\/Dynamic Partitioning<\/a><\/li><\/ul><\/nav><\/div>\n<h3 style=\"text-align: justify;\"><span class=\"ez-toc-section\" id=\"Contiguous-Partition\"><\/span>Contiguous Partition<span class=\"ez-toc-section-end\"><\/span><\/h3>\r\n<p style=\"text-align: justify;\">Contiguous Partition categorized into two ways.<\/p>\r\n<ol style=\"text-align: justify;\">\r\n<li>Single Partitioning (Single User, Single process)<\/li>\r\n<li>Multiple Partitioning (Fixed\/Static and Variable\/Dynamic)<\/li>\r\n<\/ol>\r\n<h3 style=\"text-align: justify;\"><span class=\"ez-toc-section\" id=\"1-Fixed-PartitionsStatic-Partitioning\"><\/span>1. Fixed Partitions\/Static Partitioning<span class=\"ez-toc-section-end\"><\/span><\/h3>\r\n<p style=\"text-align: justify;\">Memory is divided into fixed-sized partitions (fixed means number of partition are fixed and not size). All partitions either equal (same) size or unequal size partitions. One partition is allocated to each active process in the multiprogramming set.<\/p>\r\n<h3 style=\"text-align: justify;\"><span class=\"ez-toc-section\" id=\"2-VariableDynamic-Partitioning\"><\/span>2. Variable\/Dynamic Partitioning<span class=\"ez-toc-section-end\"><\/span><\/h3>\r\n<p style=\"text-align: justify;\">The partitions are created dynamically. When a process arrives, it allocates memory from a hole large enough to accommodate it. Operating system maintains information about allocated partitions and free partitions.<\/p>\r\n<p style=\"text-align: justify;\">Memory is allocated contiguously to processes until there is no available block of memory large enough.<\/p>\r\n\r\n\r\n\r\n<p style=\"text-align: center;\"><a class=\"btn btn-danger\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/operating-system\/what-is-deadlock-in-operating-system-os\/\" target=\"_blank\" rel=\"noopener\">&lt;&lt; Previous<\/a> | <a class=\"btn btn-success\" role=\"button\" href=\"https:\/\/study.madeeasy.in\/cs-it\/operating-system\/what-is-paging-in-os-operating-system\/\" target=\"_blank\" rel=\"noopener\"> Next &gt;&gt;<\/a> <br \/><strong> Must Read: <\/strong> <a href=\"https:\/\/study.madeeasy.in\/subjects\/what-is-an-operating-system-and-its-types\/\" target=\"_blank\" rel=\"noopener\"><strong>What is an operating system and its types?<\/strong><\/a><\/p>\r\n<p>&nbsp;<\/p>\r\n<table class=\"table table-striped table-bordered table-condensed\" style=\"margin: 0 auto; width: 99%;\">\r\n<tbody>\r\n<tr>\r\n<th colspan=\"2\" width=\"558\">Check More Links:<\/th>\r\n<\/tr>\r\n<tr>\r\n<td width=\"239\">1. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/what-is-a-program-interrupt-and-its-types\/\" target=\"_blank\" rel=\"noopener\">What is program interrupt?<\/a><\/td>\r\n<td width=\"319\">2. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/what-do-you-mean-by-addressing-modes-and-its-types\/\" target=\"_blank\" rel=\"noopener\">What do you mean by addressing mode?<\/a><\/td>\r\n<\/tr>\r\n<tr>\r\n<td width=\"239\">3. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/operating-system\/what-is-logical-virtual-vs-physical-address-space\/\" target=\"_blank\" rel=\"noopener\">Logical address space and physical address space<\/a><\/td>\r\n<td width=\"319\">4. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/operating-system\/what-is-cpu-scheduling-and-its-types\/\" target=\"_blank\" rel=\"noopener\">Types of CPU Scheduling<\/a><\/td>\r\n<\/tr>\r\n<tr>\r\n<td width=\"239\">5. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/what-is-the-functionality-of-control-unit\/\" target=\"_blank\" rel=\"noopener\">What is the function of control unit?<\/a><\/td>\r\n<td width=\"319\">6. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/what-is-i-o-modules-and-its-types\/\" target=\"_blank\" rel=\"noopener\">I\/O module in computer architecture<\/a><\/td>\r\n<\/tr>\r\n<tr>\r\n<td width=\"239\">7. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/floating-point-representation\/\" target=\"_blank\" rel=\"noopener\">Floating point representation in computer architecture<\/a><\/td>\r\n<td width=\"319\">8. <a href=\"https:\/\/study.madeeasy.in\/cs-it\/computer-organization-and-architecture\/what-do-you-mean-by-flynns-classification\/\" target=\"_blank\" rel=\"noopener\">Flynn&#8217;s classification in computer architecture<\/a><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<p>&nbsp;<\/p>\r\n","protected":false},"excerpt":{"rendered":"<p>The concept of a logical address space that is bound to a separate physical address space is central to proper<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[94,3],"tags":[109,110,111],"class_list":["post-388","post","type-post","status-publish","format-standard","hentry","category-operating-system","category-cs-it","tag-memory-allocation-techniques","tag-physical-address-space","tag-what-is-logical"],"_links":{"self":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/388","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/comments?post=388"}],"version-history":[{"count":0,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/posts\/388\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/media?parent=388"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/categories?post=388"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.madeeasy.in\/study\/wp-json\/wp\/v2\/tags?post=388"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}