Closed

Simulation program for technics in memory placement : best fit ,worst fit , buddy

This project was awarded to Begemoth for $50 USD.

Get free quotes for a project like this
Employer working
Awarded to:
Skills Required
Project Budget
$30-$50 USD
Total Bids
6
Project Description

In this project we want from you to develop a simulation program about the technics of memory placements best-fit, worst fit, buddy. The new processes (Virtual Processes, VP) that they should be placed in memory,occured according to the Poisson allocation (the time between two sequential arrivals is independent and exponentially allocated with middle duration t). The random size (in KB) of every VP is uniformly allocated in space [low_limit,high_limit]=[lo,hi]. The lifetime (in sec) of every process is exponentially allocated with middle duration T. The total duration of simulation (D) would be defined as a program parameter. Also hi,lo,t,T and the size of memory S (in KB) would also be program parameters. We can calculate the performance of every technic by using :

1) the result of multiplying the time with the memory E and
2)the middle value and fluctuation of the spaces in memory.

For the development of the simulation system, you must develop 2 processes, the G (generator) and the M (memory manager). The G creates VP and then apprises the M for the placement in memory (message VP_Start). Also G apprises the M for the completion of every VP with an appropriate message (VP_Stop).

All VPs that they couldn't be placed in memory immediately, they would be registered in a special list L (list of pending applications). The elements of L list would be checked and when there is free space in memory they would be placed there. Each VP that it has been placed in memory , it could be removed from memory only when its lifetime is over.

You must execute the simulation program many times with different values of lo,hi,t,T. M should create and maintain an analytical log file with information about the start and stop of every VP, the VPs that are pending (their waiting time until they have been written in memory, size of every pending VP, multitude of pending VPs) and also the results from the two performance calculation technics above.

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online