Maple Review
Wiki
Wiki
Dictionary
Idiom
Character search
Word Link Tree
Chinese Expert
Knowledge Tree
Chinese English
English Chinese
Language Converter
Time Channel
Dynasty
Country
Today in History
Read
Poems
Novel
History
Wiki
Prose
Tourism
Drama
Search
User
Password
Sign in
Register
English
简体
繁體
pīnyīn
My
Picture
My Map
Collections
I remember
Poems
Novel
History
Wiki
Prose
Tourism
Drama
Maple Review
Feedback
About us
Contextual Help
Help
technology
>
Optimum adapt algorithm
最佳适应算法
(best fit):
它从全部空闲区中找出能满足作业要求的、且大小最小的空闲分区,这种方法能使碎片尽量小。为适应此算法,空闲分区表(空闲区链)中的空闲分区要按大小从小到大进行排序,自表头开始查找到第一个满足要求的自由分区分配。该算法保留大的空闲区,但造成许多小的空闲区。