Loading job: the first adaptive algorithm is adopted. Enter the size of the job to be loaded, and the program will find the appropriate placement; If space is insufficient, give a reminder of "insufficient memory"; If the total residual space is sufficient, but the distribution is not continuous, then the memory should be sorted. If the total number of jobs has reached a maximum, a prompt is given at the time of insertion, requiring the removal of unneeded jobs. Removal of the job: the starting address of the job to be removed is required. The program finds the target table, sets its status blank, and checks its adjacent table. If it is empty, merge it. If the first address entered is not found in the table, the error is prompted. The free list cannot be removed again; A table with zero initial address is an operating system and cannot be removed. Collating memory: to move all the assigned table items to the lower address side, to make a slice of it, and all the free tables will be merged into the "empty table" of the table tail.

Packet : 37724097neicun.rar filelist
内存分配.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．