将体系结构构建块分配到体系结构中的各个层。
Allocation of architectural building blocks to the various layers in the architecture.
按块分配磁盘空间就意味着要逐块更新元数据。
两个基本角度是检查内存越界和跟踪内存块分配和释放。
The two basic aspects of this problem are checking memory corruption and tracing block allocation and release.
这是最后一个与相邻块相关的优化，即针对ext4的块分配器。
A final optimization-again, contiguous block related-is the block allocator for ext4.
ext4使用块分配器修复了这个问题，它能够在磁盘上一次分配多个块。
Ext4 fixes this with a block allocator that allocates multiple blocks at a time, likely contiguous on disk.
如果一次分配多个块，对块分配器的调用就会大大减少，从而加快分配并减少处理量。
Allocating multiple blocks at a time requires many fewer calls to the block allocator, resulting in faster allocation and reduced processing.
在块分配功能模块中实现耗损平衡策略需要考虑到数据更新速度和块擦除频率之间的关系。
Implementing the policy in block allocation module needs to consider the relation between the rate of data refreshment and the block-erasing frequency.
如果在计算处理完成之前，内存或磁盘空间的块分配已经耗尽，用户就会看到内存或磁盘空间用完的错误消息。
If the allocation of parts of either memory or disk space have been exhausted before a calculation process is complete, your user will get an error message that memory or disk space has run out.
和ext2 不同，ReiserFS并不固定地以1k或者4k 的块分配存储空间，而是分配所需要的精确尺寸。
Unlike ext2, ReiserFS doesn't allocate storage space in fixed one k or four k blocks. Instead, it can allocate the exact size it needs.
内存管理通常是由来自编码人员的请求处理的，以分配和释放内存块。
Memory management is usually handled by requests from the coder to allocate and release blocks of memory.
内存管理器以块的形式将内存分配给线程，以最小化堆锁定争用。
The memory manager allocates memory to threads in chunks to minimize contention on the heap lock.
因为它采用树的形式，树中有不同大小的节点，所以对分配的块大小没有限制。
Since it is maintained as a tree with varying sized nodes, there are no limitations on the allocation block sizes.
高速缓冲在连续分配和释放很小的块的程序中是一个很好的主意。
Caching can be a good idea in programs that continuously allocate and release chunks of only a few sizes.
这样所需磁盘空间总数就一目了然，因此这个功能提高了分配连续磁盘块的可能性。
This functionality improves the chances that sequential disk blocks are allocated, because the total number needed will be known.
在重新分配时，比较请求的大小和已分配块的大小。
During reallocation, the requested size is compared against the existing size of the allocated block.
AIX未存储关于哪些代码路径默认分配了特定内存块的信息，但这些信息很容易获得。
AIX does not store information about which code path allocated a particular chunk of memory by default, so this information is not easy to get.
当接下来还需要帐户POID时，服务会立即从这个保留的块中予以分配，这样就减少了额外远程数据库事务的需要。
When subsequent account POIDs are required, they will be allocated immediately from this reserved block, eliminating the need for additional remote database transactions.
它还提供了一种方法来定义一组磁盘块和文件分配的硬、软限制，以及软限制强制实施为硬限制前的过渡期。
It also provides a method to define a set of hard and soft disk block and file allocation limits and the grace periods before the soft limit becomes enforced as the hard limit.
这种优化的关键是延迟物理块的分配，直到需要在磁盘上写这些物理块时才对其进行分配并写到相邻的块。
The key to this optimization is that by delaying the allocation of physical blocks until they need to be written to the disk, more blocks are present to allocate and write in contiguous blocks.
对于存储池中的每个条目，可以配置可从该条目分配的块的最小大小。
For each entry in the storage pool, it is possible to configure the minimum size of a chunk that can be allocated from that entry.
然而，我们将尝试为ESTORE分配10块160MB的内存。
However, we will try to allocate 10 chunks of 160mb for ESTORE.
清单3 中的函数释放链表中的所有内存块，然后释放由 newBuffer()分配的Buffer 。
The function in Listing 3 frees any memory blocks in the linked list, then frees the Buffer allocated by newBuffer().
Resier4 拟定通过wandering日志和延迟分配块直至日志提交（像在 XFS 中一样）的方式来实现更优秀的日志记录。
Resier4 was designed for better journaling through the use of wandering logs and delayed allocation of blocks until the journal is committed (as was done in XFS).
当从空闲池分配块时，首先使用以下公式把请求的字节数转换为bucket数组索引。
A block is allocated from the free pool by first converting the requested bytes to an index in the bucket array, using the following equation.
也可以使用V11.7中的StorageProvisioning特性来确保在需要时自动分配块。
You may also use the Storage Provisioning feature in V11.7 to ensure chunks are automatically allocated when required.
extendsize-这是空间中可自动扩展的块的最小分配大小。
Extend size - this the minimum allocation size by which a chunk in this space can be automatically extended.
如果需要per - CPU数据(这在检查区段头时确定)，那么就分配per - cpu块。
If per-CPU data is needed (as determined in the section header checks), a per-CPU block is allocated.
记住，ext3一次只分配一个块。
如果当前块都不可扩展，Informix可以使用存储池自动分配新块给存储空间。
If none of its current chunks are extendable, Informix can automatically allocate a new chunk to the storage space using the storage pool.
所以，如果一个字节序列可以是一个指向一块被分配的内存的指针，那么收集器就将其标记为正在被引用。
So, if a sequence of bytes could be a pointer to a piece of allocated memory, it marks it as being referenced.
应用推荐