basic algorithm

基本解釋

With this basic algorithm for restore, it is easy to implement a simple infrastructure.
利用這種基本的恢復(fù)算法，很容易實(shí)現(xiàn)一種簡(jiǎn)單的基礎(chǔ)設(shè)施。
As mentioned above, the basic algorithm imposes a minimum chunk size that can be very wasteful for very small requests.
如上面提到的，基本算法對(duì)于很小的請(qǐng)求也征用一個(gè)最小的塊，這是十分浪費(fèi)的。
In the most straightforward version of the basic algorithm, each freed chunk is immediately coalesced with neighbors to form the largest possible unused chunk.
在這個(gè)基本算法的最簡(jiǎn)單的版本中，每一個(gè)被釋放的塊被立即合并到相鄰的塊以形成一個(gè)盡可能最大的未使用塊。