The objective of this week’s lab is to simulate and evaluate different memory allocation/deallocation techniques ( , , , and )when a linked list is used to keep track of memory usage. . This lab is designed to be completed in two weeks. One allocation/deallocation technique is due on Week 4, and the second technique is due on Week 5. Assume that the memory is 256 KB and is divided into units of 2 KB each. A process may request between 3 and 10 units of memory. Your simulation consists of three components: a component that implements a specific allocation/deallocation technique, a component that generates allocation/deallocation requests, and a component that prints out the relevant statistics. The Memory component exports the following functions: The request generation component generates allocation and deallocation requests. For allocation requests, the component specifies the process ID of the process for which memory is requested as well as the number of memory units being requested. For this simulation, assume that memory is requested for each pro
cess only once. For deallocation requests, the component specifies the process ID of the process whose memory has to be deallocated. For this simulation, assume that the entire memory allocated to a process is deallocated on a deallocation request. You may generate these requests based on some specific criteria, e.g., at random or from a memory allocation/deallocation trace obtained from some source. There are three performance parameters that your simulation should calculate for the chosen two techniques: , and Generate 10,000 requests using the request generation component, and for each request, invoke the appropriate function of the Memory component for each of the memory allocation/deallocation techniques. After every request, update the three performance parameters for each of the techniques. The statistics reporting component prints the value of the three parameters for the two techniques at the end. You will submit separate files to the dropbox for Week 4: Purchase the answer to view it Purchase the answer to view it Purchase the answer to view it