Running head: Solving Memory Management Problems 1 Assignment 1: Solving Memory Cecil Covin Jr Study.com Author Note First paragraph: Introduction Second paragraph: Memory Allocation & Paged Memory...

to emulate how operating systems manage memory paging, allocation, deallocation and replacement. Upon completion of this project you will be able to:

• Describe how operating systems manage memory


• Use simple codes to emulate basic functionalities of operating systems

Running head: Solving Memory Management Problems 1 Assignment 1: Solving Memory Cecil Covin Jr Study.com Author Note First paragraph: Introduction Second paragraph: Memory Allocation & Paged Memory Allocation Third paragraph: Memory Deallocation & Page Replacement Fourth paragraph: Coding Analysis & Example Solving Memory Management Problems 2 In this paper I will describe how operating systems manage memory and use simple codes to emulate basic functions as taught in Chapter 3 of the course ​Memory Management & Operating Systems​. A computer’s operating system has a major function called ​Memory Management ​which means it controls and coordinates the computer’s memory. The sections of memory are set aside to be used later on in applications as needed. The act of setting aside and later using the memory is called ​Memory Allocation​. ​Memory Allocations​ determines if memory can be ​allocated​ or deallocated​. ​Allocation​ and​ deallocation​ means that memory is used or not used depending on the need of the computer at the moment. ​Best-fit​ memory means that the operating system will allocate the smallest amount of memory space that will fulfill the task for the process. The operating system also uses​ first-fit​ allocation, that means that the system will allocate whichever memory it finds that is good enough to complete the task. Paged memory allocation is a little different from normal allocation, pages are the process of storing a portion of an executing process on a disk or secondary memory. ​Frames ​are the sections used to divide up memory and pages​ are what go into frames. ​Demand page memory​ occurs when memory is taking in and out of main memory from secondary memory as needed for tasks. Page tables not only keep track of demand memory allocation, but it is also used to track and locate where the different pages of a process or task are located. Dellocation​ is used to free up memory from ​random access memory​ (RAM) and so it can be put where it is needed. The ​trash bin​ or ​garbage collection ​program on operating systems are Solving Memory Management Problems 3 considered high-level deallocation. ​Paging ​is a process of reading data from and writing to, the secondary storage. ​Page fault​ is a computer hardware raised interrupt or an exception when a running program accesses a memory page that is not currently mapped into the virtual address space of the program. Operating systems can also use page replacement algorithms which include ​First-In-First Out, Least Recently Used, Least Frequently Used, Not Recently Used, Not Frequently Used and Random. Solving Memory Management Problems 4 References Study.Com. Sudha Aravinda, study.com/academy/lesson/memory-allocation-schemes-definition-uses.html. ● Avinash Srivivasan​. study.com/academy/lesson/page-replacement-definition-algorithms.html. ● Study.Com​. Lyna Griffin, study.com/academy/lesson/paged-memory-allocation-definition-purpose-structur e.html. ● ---​. Meghaless Goswami, study.com/academy/lesson/memory-deallocation-definition-purpose.html.