Preview

Process and Memory Managment

Good Essays
Open Document
Open Document
670 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Process and Memory Managment
Memory Management
The memory management is one of the core components of an operating system which manages the memory hierarchy of Random Access Memory (RAM), and hard disks. The important tasks of the operating systems in managing the memory include: the allocation and de-allocation of memory to the processes, the utilization of the hard disk for implementation of the Virtual Memory. The operating system should effectively use the memory component as it directly impacts the overall efficiency and performance of the computer system (Khetan, 2002).
The Windows operating systems use a tree form of data structure rather the linked list. Each node of the tree is known as Virtual Address Descriptors (VAD) having a range of memory addresses. It is the responsibility of the VAD to mark each and every node as reserved for thread’s stack, free or committed.
The Linux and UNIX operating systems implement the virtual memory data structure. These operating systems maintain a linked list that represents continuous memory areas having same commit state information and protection parameters. The operating system searches the linked list every time it is required to find out the page having particular location. The data structure of these operating systems maintains the records of addresses mapping onto the applications, protection mode of the memory and the growing direction.
After the system booting, the Macintosh operating system divides the available Random Access Memory (RAM) into two major categories include: the reserved section and user available section. In the reserved section, it reserves a partition of memory for its own use which is known as system partition that begins at the lowest level of memory and rises. The remaining memory is allocated for software applications (Mindfire Solutions, 2002).
Process Management
The programs, services or applications that are being executed by the computer either at the background or front end is said to be a process.



References: Mindfire Solutions. (2002). Memory Management in Mac OS. Retrieved from: http://www.mindfiresolutions.com/mindfire/Mac_Memory_Manager.pdf Khetan, G. (2002). Comparison of Memory Management Systems of BSD, Windows, and Linux. Department of Computer Science, University of Southern California, Los Angeles, CA.

You May Also Find These Documents Helpful

  • Good Essays

    Some OS routines directly support application programs as they run and thus must be resident. Other transient routines are stored on disk and read into memory only when needed. Fixed-length partitions can also be used to allocate the set amount of memory that a particular program needs to run. Under dynamic memory management, the transient area is treated as a pool of unstructured free space. When the system decides to load a particular program, a region of memory just sufficient to hold the program is allocated from the pool. Using segmentation, programs are divided into independently addressed segments and stored in noncontiguous memory. Paging breaks a program into fixed-length pages.…

    • 7085 Words
    • 29 Pages
    Good Essays
  • Satisfactory Essays

    SD1230 Lab 1

    • 239 Words
    • 2 Pages

    1. Why is virtual memory addresses used for applications? – So it can have its own address space on the memory.…

    • 239 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Pos355 Project

    • 870 Words
    • 4 Pages

    Presentation for Memory Management (Linux, MAC, Windows) Presentation for Process Management (Linux, MAC, Windows) Presentation for File Management (Linux, MAC, Windows) Presentation for Security Management (Linux, MAC, Windows Team D review WK 4 Assignment. Team D submit Rough Draft of Final Power Point Presentation. Proceed? Finalize Linux, Mac, Windows Presentation Finalize Linux, MAC, Windows Paper Team D…

    • 870 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    POS355 Week 1 Individual

    • 574 Words
    • 2 Pages

    There are several items that are pertinent to memory management such as, basic hardware, the binding of symbolic memory addresses to definite physical addresses and the difference between logical and physical addresses. The most important task that memory management executes is the distribution and collection of memory…

    • 574 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    BTEC ICT Unit 2 P1

    • 944 Words
    • 4 Pages

    There are two types of memory which we need and use on our computers one of them is RAM and the other one is cache.…

    • 944 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Random-access-memory (RAM) is a very important specification of the computer. By ensuring you have enough RAM, the faster your system processes, you can store more data, and allow more programs to run at the same time. As the OS allows the different task to complete for the processor, the RAM is used as temp storage, when the processor no longer needs them the OS clears it. Virtual memory is the hard drive space borrowed to use if there isn’t enough…

    • 580 Words
    • 3 Pages
    Good Essays
  • Better Essays

    Week 5 Pos 355

    • 2010 Words
    • 9 Pages

    Memory management is an important part of an operating. The UNIX/Linux OS use numerous intricate algorithms for memory management which will permit the system to…

    • 2010 Words
    • 9 Pages
    Better Essays
  • Good Essays

    Memory management is an important characteristic of an operating system. Main memory is divided into two parts one for resident programs, and the other for the program currently in use. The user part must be subdivided to accommodate multiple processes (Stallings, 2012). When a few processes are in the memory then much of the time all of the processes will have to wait for input /output and the processor will be idle. According to Stallings (2012),. The requirements that memory management is supposed to satisfy are Relocation, Protection, Sharing, Logical organization, and Physical…

    • 573 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    A disadvantage to the Multi-Store Model of Memory is that it may be over simplifying the memory processes. This model of memory doesn’t take into consideration that there are different kinds of…

    • 451 Words
    • 2 Pages
    Satisfactory Essays
  • Better Essays

    IT 600 Module One Lecture

    • 1256 Words
    • 5 Pages

    that every process gets the memory it needs, and that no application can access memory in…

    • 1256 Words
    • 5 Pages
    Better Essays
  • Best Essays

    Lemley, B., Bascar T., & Kim, K. Virtual Memory. (1999). The Core of Information Technology.…

    • 2038 Words
    • 6 Pages
    Best Essays
  • Good Essays

    For any operating system to function properly, one of the vital tasks it must be able to do is manage memory. When a program runs on a computer, it first must be loaded into memory before it can execute. There are five different requirements memory management must satisfy in order to execute the program so it runs without errors or corruption. These requirements are relocation, protection, sharing, logical organization, and physical organization.…

    • 730 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Assignment 1,Section I

    • 326 Words
    • 2 Pages

    Several methods have been devised that increase the effectiveness of memory management. Virtual memory systems separate the memory addresses used by a process from actual physical addresses, allowing separation of processes and increasing the effectively available amount of RAM using paging or swapping to secondary storage. The quality of the virtual memory manager can have an extensive effect on overall system performanc…

    • 326 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Kernel Data Structures

    • 3107 Words
    • 13 Pages

    The linked list is the most common data structure in the Linux kernel which, allows the storage and manipulation of a variable number of elements, called the nodes of the list. The elements in a linked list are dynamically created and inserted into the list. This enables the management of a varying number of elements unknown at compile time and each element in the list contains a pointer to the next element. As elements are added to or removed from the list, the pointer to the next node is simply adjusted.…

    • 3107 Words
    • 13 Pages
    Good Essays

Related Topics