搜索资源列表
最佳适应法
- 采用首次适应法、最佳适应法或最差适应法，编写一内存分配和回收模拟程序。 动态地随机产生新的“内存分配”或“内存回收”请求，再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配，所以不考虑与某内存区相关的进程情况。-used first to adapt, adapt best or the worst adaptation law, the preparation of a memory allocation and recovery simulation program. Dyn
neicunfeipei
- 编写一个C程序，用char *malloc(unsigned size)函数向系统申请一次内存空间（如size=1000，单位为字节），用循环首次适应法 addr = (char *)lmalloc(unsigned size) 和 lfree(unsigned size,char * addr)模拟可变分区内存管理，实现对该内存区的分配和释放管理。
project1
- 操作系统内存分配释放算法的C语言模拟，包括首次适应法与循环首次适应法。指令可通过io转向从文件读入-The release of the operating system memory allocation algorithm for C-language simulation, including the first cycle for the first time to adapt to meet the law and the law. Io steering commands can b
m_r
- 应用循环首次适应法模拟电脑内存的分配和释放，使用双链表-Simulation cycle for the first time to adapt to memory allocation and release of
memory_malloc
- 模拟动态内存分配的首次适应法和最佳适应法-Simulation of dynamic memory allocation for the first time to adapt to law and the best fit