CS342-Project 3 Memory Management Solved

In this project you will implement a memory management library called smemlib.a. Processes will use your library to allocate memory space dynamically, instead of using the well-known malloc function.  A shared memory object, i.e., a shared memory segment, needs to be created first. Your library will manage that memory segment. Memory space allocations will be made from that segment to the requesting processes. Your library will implement the necessary initialization, allocation and deallocation routines.   Your library will keep track of the allocated and free spaces in the memory segment. For that it can use the hole-list approach together with the first-fit, best-fit, or worst-fit strategy.  

 

Your library will implement the following functions. The first two functions will be used by programs that will create or destroy the shared segment to be used by other processes.  

 

•        int smem_init (int segsize). This function will create and initialize a shared memory segment of the given size. The given size is in bytes and must be a power of 2.  Memory will be allocated from that segment to the requesting processes later. If operation is successful, the function will return 0, otherwise, it will return -1.  You will use POSIX shm_open()  and ftruncate() functions in the implementation of this function. If there is already a shared segment, the function will destroy the segment first, before creating a new one with the same name.  After initialization, the shared segment will be ready to use. That means processes can make memory allocation requests, and memory can be allocated from this segment, if available.  

 

•        smem_remove (). This function will remove the shared memory segment from the system. You will use shm_unlink () function to implement this. The function will do all the necessary cleanup. For example, the created semaphore(s) will be removed as well.  

 

A process that would like to use the library for memory allocations will use the following functions that you will implement in your library.  

 

•        int smem_open (). This function will indicate to the library that  the process would like to use the library. In this way, the library can keep track of the processes that are interested in using the library. The library will map the shared segment to the virtual address space of the process using the mmap function. If there are two many processes using the library at the moment, sem_open will return -1. Otherwise, if the process can use the library, sem_open will return 0.

 

•        void *smem_alloc (int reqsize).  This function will allocate memory of size at least the requested size (reqsize) and will return a pointer to the allocated space. It is up to the program what to store in the allocated space. NULL will be returned if memory could not be allocated. This can happen, for example, when there is not enough memory.  

 

•        void smem_free (void *ptr). This function will deallocate the memory space allocated earlier and pointed by the pointer ptr.  The deallocated memory space will be part of the free memory in the segment.  

 

•        int smem_close (). When a process has finished using the library it will call smem_close(). In this way your library will know that this process will not use the library for memory allocation, hence shared segment can be unmapped from the virtual address space of the process. If the process would like to use the library again, it should call smem_open again.  

 

You will use semaphore(s) in your library to protect your shared structures. Processes may call allocation and free functions concurrently. This should not cause race conditions. You will ensure that by using semaphores.  

 

A program, for example app.c,  that wants to use your library for memory allocations may use the related functions as below.   

 

#include “smemlib.h”

 

#DEFINE ASIZE 1024

int main()

{          int i, ret;  

            char *p;

             

           ret = smem_open();  

            if (ret == -1) {               exit(1); // can not use the library at the moment. May try later.

}

            p = smem_alloc (ASIZE); // allocate space to hold 1024 characters              for (i = 0; i < ASIZE; ++i)                      p[i] = ‘a’; // initialize all chars to ‘a’        smem_free (p);            smem_close(); // no longer interested in using the library.  

                         

            return (0);  

}  

You will also implement two simple programs that will be called as create_memory.c and destroy_memory.c. The create_memory program will basically call the smem_init function of your library to create and initialize a shared memory segment. The destroy_mem program will basically call your smem_remove function to remove the shared segment from system.  

 

We will test your library with various programs that we will implement using your library.  

 

In your library, you will implement both the first-first and worst-fit strategy. At the end, one of them will be used as the method to search for a hole. But, for the experiments part, you will try both.  

 

Experiments and Report
 

Do a lot of experiments to see which strategy, first-fit ot worst-fit,  is more space efficient. Plot your results. Draw conclusions. Write a report to include all the experiment descriptions and results.