Laboratory ExerciseMemory ManagementObjectives:At the end of the exercise, the students should be able to:• Examine some techniques in memory partitioning; and• Analyze the underlying concepts and implications of virtual memory.PartIInstructions: Read the description of the memory configuration and analyze the given diagram. Then, answerthe following questions.Memory Configuration: A computer implements a dynamic partitioning technique for memorymanagement. A number of allocation and swapping-out operations have been caried out while thecomputer is up and running. The disgram below shows the computer's current memoryconfiguration/allocation. The addresses go from left to right. The gray areas represent blocks that areoccupied by running processes, while the white areas indicate free memory blocks. The last processthat was loaded into the memory is marked with a red X in the diagram, and its size is 2MB. On ly oneprocess was swapped out afterthat.4MB1MBSMB8MB2MB4MB3MBXQuestions1. If you are to add a new 10MB process in the memory, where could it possibly be added sandwhy?2. What could be the size of the free block just before it was partitioned by X? Rationalize youranswer.3.Would you suggest the provisioning of virtual memory in this configuration? Why or why not?4. Isit possible to add a new 7 MB process using the first-fit place ment algorith m without swappingout any process? Why or why not?5.A new process is requesting a 3MB a llocation. Illustrate the possible memory configurationusing a horizontal segmented memory strip (like the disgram above), where a partition will becreated forthe new process underthe follo wing placement algorithms: best-fit and first-fit. Labelyour illustration clearly. Part IIInstructions:1. Explain the operation and management of the following virtual memory. Search for relevant studies andliteratures that would support your answer. Properly cite your references.• Linux Virtual MemoryWindows Virtual Memory2. Then, answer the following items based on your research.a. Between the operation and management of Linux and Windows virtual memory, which do youthink is less complex and why?b. Were you able to find similarities between Linux and Windows virtual memory?o If your answeris yes, explain each similarity.o If your answer is no, explain the possible reason why there is no similarity.c. What are the possible drawbacks of not implementing virtual memory?d. If you are to design a memory management system, wouldyou incorporate virtual memory intoyour design? Why or why not?

Instructions: 1. Explain the operation and management of the following virtual memory. Search for relevant studies and literatures that would supportyour answer. Properly cite your references. Linux Virtual Memory • Windows Virtual Memory

Instructions: 1. Explain the operation and management of the following virtual memory. Search for relevant studies and literatures that would supportyour answer. Properly cite your references. Linux Virtual Memory • Windows Virtual Memory

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

Please give me correct solution.
Objective Define a circular buffer data structure and test it. Problem Description: A circular buffer (also called a circular queue) is circular list of nodes where data items are added on one end of the buffer and removed from the other end. Because the nodes form a circular list, the list has no end or beginning: the tail node points to the head node, creating a ring of nodes. You may think of the nodes as containers or slots that are all initially empty but can be assigned a value in their data field info. Every time a new data item is inserted (inserting to a buffer is often referred as Writing), one slot is filled and the buffer has one less empty slot. Every time a data item is removed (referred to as Reading), the buffer has one more empty slot. Since the list has no beginning and no end, a pointer (writeIndex) is used to mark the next empty slot to write to and a second pointer (readIndex) is used to mark the next node to read from. The readIndex/writeIndex must be…
Producer-Consumer Problem Variation. In class, we reviewed the Producer-Consumer problem, which used semaphores to control access to a bounded buffer where a Producer process would produce data items and add them to the buffer and one Consumer would remove data items from the buffer and consume them (please refer to slide 18 in the Week 9 PowerPoint or Figure 5.16 in the course textbook for the pseudocode for this problem). As a variation of that problem, assume the bounded buffer size is 12. Assume the Producer process enters 3 items at a time into the buffer. It will only do this if there are at least 3 empty spots in the buffer. Assume the Consumer process will remove items 2 at a time, and will only do so if there are at least 2 items in the buffer. In addition to the Producer and Consumer processes, assume there is a third Hybrid process. Each time it accesses the buffer its role changes. One time it is a Producer entering a single item, and the next time it is a Consumer removing…
You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm TASK2: DESCRIPTION One of the simplest methods for memory allocation is to divide memory into several fixed-sized partitions. Each partition may contain exactly one process. In this multiple-partition method, when a partition is free, a process is selected from the input queue and is loaded into the free partition. When the process terminates, the partition becomes available for another process. The operating system keeps a table indicating which parts of memory are available and which are occupied. Finally, when a process arrives and needs memory, a memory section large enough for this process is provided. When it is time to load or swap a process into main memory, and if there is more than one free block of memory of sufficient size, then the operating system must decide which free block to allocate. Best-fit strategy chooses the block…
Operating Systems Project:Design a process queue that is responsible for handling the process requests coming from different users. You have to take into consideration that users have different levels of privileges and priorities. Each user has an identification number and a password, in addition to process priorities. One good idea is to design the queue using an array or pointers while preserving the first-in-first-out concept of the queue. For every process request received, the program should check the privileges of that request and whether it can be moved forward in the queue to be served by the operating system prior to serving the other requests. Using the programming language of your choice (preferably C++), write the process queue that would handle the user request. The program must allow for requests coming from different users or from one user.
Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int…
Application of data structures to fast image recognition (very simplified) • The setting is that some image processing device gives you a 5 × 6 matrix M of bits. • We categorise these images into YES and NO answers, and this categorisation is fixed. The questions are: 1. What is the fastest data structure from the module to compute from the matrix the YES/NO answers? And how much time does an answer take? 2. How can the matrix be transformed into a standard input for the data structure? And what is the size of the data structure?
java Please draw an architecture UML diagram Below is the information: Description: The Advisor Appointment Booking System is a program that allows students to easily schedule appointments with their academic advisors. The program will maintain two sets of unconnected data: a set of advisors and a set of students. Each student can book appointments with their assigned advisor or any available advisor. Students can view their upcoming appointments, as well as cancel or reschedule them if needed. Advisors can view their own schedules and manage their availability. The program will save all data to a file or set of files so that it persists from one run to the next. Target User: The target users for this program are college students and academic advisors. Storyboard: Students log in to the program and are directed to their personalized dashboard. On the dashboard, students can view their upcoming appointments and request new appointments with their assigned advisor or any available…
This lab addresses the following major topics: • 2d arrays Vectors, array of vectors Input/output files • Introduction of Structures You will find the instruction file along with any additional files on blackboard. In this category of lab activity students are expected to write a complete program during the lab and submit the compiling program on blackboard before the end of the lab session. . . The instructor will give a brief description of the assignment and provides limited help throughout the lab. Students can use the textbook, class notes or sample programs to complete the assignment, but are PROHIBITED from collaborating with one another. Requirements for the program: This lab assignment has 4 parts, for grading purposes, separate each part in your program using a comment line such as: Part I: In an input file called inData. txt, we have 6 lines of data in the following pattern per line: One-word name of a student followed by 5 assignment scores (all integers). An example of…
How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.
Cooperating Processes: Select all of the following statements that are true. Ordinary (unnamed) pipes provide a solution for bidirectional communication between related processes. Mechanisms for inter-process communication enable different processes to exchange information and synchronize their actions. The bounded buffer solution to the producer-consumer problem, which was the first one discussed in class and does not use semaphores or monitors, allows at most BUFFERSIZE items in the buffer at the same time.
Explain how "garbage collection" can be impacted by serialized objects in memory-intensive applications.