请求块用英语怎么说,请求块的英文翻译


词语导航

基本信息

词语:请求块

繁体:請求塊

拼音:qǐng qiú kuài

英语翻译

【计】 request block

分词翻译

请求的英语翻译:

ask for; beg; claim; desire; petition; pray for; request; solicit
【计】 C; request
【经】 application; demand; petition; request; solicit

块的英语翻译:

lump; agglomeration; clump; dollop; loaf
【计】 B; block
【医】 block; lump; mass; massa

翻译例句

1. 而当请求块的数目增加时,fcm缓冲区的数目(fcm_num_buffers)也会增加。

As the number of request blocks goes up, the number of FCM buffers (fcm_num_buffers) goes up.

2. 对在线系统的请求过多:用户太多了,全都在一块了!

High request volumes for online systems: Lots of users, all at once!

3. 这种策略把分配请求的大小向上取整到下一个可用的块大小。

This policy rounds off the size of the allocation request to the next highest available block.

4. 如上面提到的,基本算法对于很小的请求也征用一个最小的块,这是十分浪费的。

As mentioned above, the basic algorithm imposes a minimum chunk size that can be very wasteful for very small requests.

5. 内存管理通常是由来自编码人员的请求处理的,以分配和释放内存块。

Memory management is usually handled by requests from the coder to allocate and release blocks of memory.

6. 当一个过程等待一个块设备数据请求完成时,它会增加 I/O等待时间,而所有空闲都会变成等待时间。

When a process waits for a block device data request to complete, it incurs I/O wait time, and all idle time becomes wait time.

7. 结果,如果没有足够大的自由内存块能够满足请求的需要,则分配一个很大的对象就会失败。

As a result, the allocation of a sufficiently large object can fail if no free chunk of memory is large enough to satisfy the request.

8. 第一个分配程序是通用分配,可以满足针对任何数量的连续内存块的请求。

The first is a general-purpose allocation and can serve requests for any number of contiguous chunks.

9. 应用接收到客户端的第一个请求时,加载和执行合适的块。

When the client"s first request is received, the appropriate chunk is loaded and executed.

10. 缓冲区缓存会缓存文件系统和相关块设备之间的请求。

The buffer cache buffers requests between the file systems and the block devices that they manipulate.

11. 一旦处理完请求并送回响应,该块就可以卸载了——内存中不用保留任何内容。

Once this request has been handled and a response sent back, this chunk can be unloaded - nothing need remain in memory.

12. 如果空间不包含可扩展块且存储池不包含请求的空间,命令会失败。

If the space contains no extendable chunks and the storage pool does not contain the requested space, the command will fail.

13. 需要两个配置步骤来在聚合块内支持多个未完成请求。

There are two configuration steps required to enable multiple outstanding requests within an aggregation block.

14. 首先,删除空闲树中(大于或等于请求的块大小的)地址最低的节点。

First, the node from the free tree with the lowest address (which is greater than or equal to the requested block size) is removed.

15. 在重新分配时,比较请求的大小和已分配块的大小。

During reallocation, the requested size is compared against the existing size of the allocated block.

16. 理想情况下,对于这些块的请求应该来自于内存,而不是来自于磁盘。

Ideally, requests for these blocks should come from memory instead of disk.

17. 这个函数启动AJAX请求并添加一个包含文本的div块。

This function is starting the AJAX request and adding an DIV Block with some more text.

18. 如果发出请求的代码块是在请求HTML,这段代码会执行第一个闭包;如果发出请求的代码块在请求XML,这段代码会执行第二个闭包。

If the request block is requesting HTML, it executes the first closure; if it"s requesting XML, it executes the second.

19. Linux的这个块层组件称为丢弃请求,它来自于更高级别的文件系统的文件删除。

The Linux block layer component of this is called a discard request, which results from a higher-level file system file deletion.

20. 内存分配由Database . malloc (intsize)执行,它首先确定用于提供所请求内存的块的最小数目。

The memory allocation is performed by Database.malloc (int size), which starts by determining the minimum number of blocks needed to provide the requested memory.WWw.wentiyi.COM

21. 然后,BitTorrent要依靠终端用户(称为节点),这些用户请求下载文件,再接收该文件的不同块。

It then relies on end users (called peers) who request the file and receive different pieces of it.

22. 当从空闲池分配块时,首先使用以下公式把请求的字节数转换为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.

23. fast _ pool_allocator最适合于一次请求单个(通常较大)块,但是也适用于通用分配,不过具有一些性能缺点。

Fast_pool_allocator is best suited for requesting a single (often big) chunk at a time but also works for general purposes with some performance handicap.

24. 当执行到 catch块时,将使用缓存的主体准备SOAP请求,并随后调用Web服务。

When the control reaches the catch block, a SOAP request is prepared using a cached body, and a Web service is invoked.

25. 与Yorktown策略相似,Watson搜索大小树,寻找符合请求的最小的块。

Similar to the Yorktown policy, Watson searches the size tree and finds the smallest possible block suitable for the request.

26. 一个丢弃请求是此块层的一部分,提供了丢弃块的途径,并最终会导致向提供支持的ATA设备发出一个trim命令。

A discard request is part of the block layer and provides the means to discard blocks, eventually resulting in a trim command to a supporting ATA drive.

27. 在 2.6 中块I/O缓冲区(kiobuf)允许 I/O请求可以比 PAGE_SIZE大。

The block I/O buffer (kiobuf) in the 2.6 kernel allows I/O requests larger than PAGE_SIZE.

28. 最后,respond _ to块将处理iPhone请求。

Finally, the respond_to block handles the iPhone requests.

29. 今天,我要请求你们的帮助,请求你们在心中保留一块地方,为了在某一天重新接纳和信任我。

Today I want to ask for your help. I ask you to find room in your heart to one day believe in me again.

30. 今天,我要请求你们的帮助,请求你们在心中保留一块地方,为了在某一天重新接纳和信任我。

Today I want to ask for your help. I ask you to find room in your heart to one day believe in me again.

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!