(855) 4-ESSAYS

Type a new keyword(s) and press Enter to search

Introduction to Memory Management


The name dynamic linking means that the linking happens at the point of execution while the other way of linking is known as static linking which entails these pieces being linked at the time of loading. .
             Logical vs. physical address space, addresses generated by the operating system are referred to as logical addresses as they don't exist on the computer hardware but on the operating system. On the hand the available memory unit that is available is referred to as physical memory. Swapping, the process of temporarily moving a process out of main memory to a temporarily backing storage and then brought back later into memory for executing is referred to as swapping. The backing storage used often is the hard disk drive. When talking about memory allocation we are referring to two things, one being the memory allocated to the operating system and second the memory used by user processes. .
             Fragmentation refers to the problem that occurs when processes are moved into main memory and removed leaving memory spaces that keep piling and up and therefore reducing system and memory efficiency. .
             Paging is the process in which memory (physical) is broken into equal sized memory blocks referred to as pages. This is normally done to avoid problems of fragmentation. When loading a process is brought into memory its pages are loaded into available memory frames. Segmentation refers to the process of breaking memory into logical pieces in which each piece represents a group of related information. Segments which are a result of segmentation can have varying sizes therefore avoiding internal fragmentation.
             Algorithms are defined steps and techniques that can be used to solve a given problem or task. For these steps to qualify to be an algorithm they have to be reusable and flexible. This means that they can be easily followed to achieve a solution and can be used to a different variety or scale. In this context we are going to study the different memory algorithms which include garbage collection, buddy methods, paging algorithms and sequential fit methods.


Essays Related to Introduction to Memory Management


Got a writing question? Ask our professional writer!
Submit My Question