Description: 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.
To Search:
- [145388202] - visual c windows shell programming
- [merroy] - Simulation of the operating system varia
- [S_Shell] - 鲁 脤脨貌脫脨脪 禄赂 枚渭脟脗 陆
- [subplot] - Matlab rendering the use of subgraph fun
- [neicunfenpai] - Main memory allocation and recovery+ Fir
File list (Check if you may need any files):
Download