首页 | 本学科首页   官方微博 | 高级检索  
     

动态分区分配与回收算法的模拟
引用本文:邓曦辉.动态分区分配与回收算法的模拟[J].电脑开发与应用,2013(4):61-63.
作者姓名:邓曦辉
作者单位:晋中学院计算机科学与技术学院
摘    要:为了探索和改进操作系统课程的教学方法,加强学生对动态分区的深入理解,采用C语言中的链表模拟实现了动态分区中的两种分配算法:首次适应算法(First Fit)、最佳适应算法(Best Fit),以及内存回收算法。模拟结果表明:这种理论加实践的教学不仅有助于学生掌握操作系统的理论知识,使抽象内容具体化,而且有助于提高学生分析数据、选择数据结构以及综合编程的能力。

关 键 词:内存管理  动态分区  首次适应  最佳适应  指针数组

Simulation of Dynamic Partitioning Allocation and Recovery Algorithm
DENG Xi-hui.Simulation of Dynamic Partitioning Allocation and Recovery Algorithm[J].Computer Development & Applications,2013(4):61-63.
Authors:DENG Xi-hui
Affiliation:DENG Xi-hui(School of Computer Science and Technology,Jinzhong University,Jinzhong 030600,China)
Abstract:In order to explore and improve the teaching method of operating system,strengthen students’in-depth understanding of the dynamic partitioning,This paper,based on linked list in the C language realized two memory allocation algorithms: First Fit algorithm(First Fit),Best Fit algorithm(Best Fit),and memory recovery algorithm.The simulation show that: the theory and practice of teaching not only helps students to master the theoretical knowledge of operating system,embodys abstract contents,but also helps to improve students’ability of analyze data,choose data structure and integrated programming.
Keywords:memory management  dynamic partitioning  first fit  best fit  pointer array
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号