Memory Management Essay

2328 Words Oct 19th, 2013 10 Pages
Memory Management
Federico Torres
POS 355
April 9, 2013
CASTLE W. PHELPS, ABD

Memory Management
“I cannot guarantee that I carry all the facts in my mind. Intense mental concentration has a curious way of blotting out what has passed. Each of my cases displaces the last…”(Doyle, 1901). The way the brain manages memory is metaphorically speaking very similar to the way computers today manage memory. A memory management unit takes a huge part in the speed at which computers can operate. The memory management unit works systematically with the operating system and computer processing unit. There are two different parts to types of memory, primary, also referred to as main, and secondary. The former has two parts, one part for the
…show more content…
A program is unable to predict what memory address it will reside in prior to execution or what other processes will be running at the same time. That is why a program must be compiled in such a way that it may be loaded from an unpredictable address in memory (Stallings, 2012, pp. 307). When a program is developed, the assembler or compile will produce reference addresses that relate to some starting point, such as the beginning of a program. From there all other modules will be expressed in references relative to the beginning of the starting module. Once a load module is loaded into main memory, all other memory references are in relative form (Stallings, 2012, pp. 307). Once an instruction is executed, the physical address is then calculated. To ensure that no performance is lost, this process is done by hardware versus software.
Within main memory, there can be a number of processes being executed. Each process should and must be protected from unwanted interference from other processes in main memory. By using the process of relocation, protection is a resultant of such requirement. With paging and segmentation, protection to memory locations is accomplished. Paging occurs when main memory is partitioned to equal fixed- sizes, and then the process is divided into equally small sizes that will fit within available memory chunks (frames). Once the process is broken

Related Documents