We allow an additional time buffer associated with the critical path, and not the other tasks.
我们允许一个在关键路径上添加附加时间来进行缓冲，但并不是在某一任务中添加时间。
In this particular program, doing buffer handling in this way does not affect the execution time significantly, and in some data sets, affects it negatively.
在这个程序中，以这种方式执行缓冲区处理并不会显著影响执行时间，而对于某些数据集，可能有消极影响。
You must give yourself some buffer time to cover unexpected events - like a sudden traffic jam.
你必须给自己一些缓冲时间以防预料之外的事件——比如意外的交通堵塞。
You must give yourself some buffer time to cover unexpected events -like a sudden traffic jam.
你必须给自己一些缓冲时间以防预料之外的事件——比如意外的交通堵塞。
Fundamentally, any time your program reads or copies data into a buffer, it needs to check that there's enough space before making the copy.
从根本上讲，在程序将数据读入或复制到缓冲区中的任何时候，它需要在复制之前检查是否有足够的空间。
When the buffer fills, it wraps so that it provides a finite view back in time of optimized local adapter processing.
在缓冲区填满时，它进行包装，以使其在优化的本地适配器处理时提供有限的视图。
The basic idea is to give each pipeline its own buffer for processing, and then process each buffer a stage at a time.
基本思想是给每个管道分配一个要处理的缓冲区，然后按一次处理一个阶段的方式处理每个缓冲区。
You might be able to find a happier medium by reading a series of bytes into a buffer at a time, thus saving the method calls.
您或许能够通过每次将一系列字节读取到缓冲区中找到更加令人高兴的方法，从而减少方法调用。
The average value for each key dwell time for the entire buffer is computed and returned.
将计算并返回整个缓冲中的每个按键停顿时间的平均值。
When this approach is in use, hashed rows destined for a given partition are placed in a buffer and sent to that partition as a group instead of one at a time.
如果使用了这种方法，定向于某个给定分区的散列行首先会进入一个缓冲区中，然后成组地发送到那个分区，而不是一次发送一行。
In this column we've introduced you to buffer overflows, which are probably the worst software security problem of all time.
在本专栏中，介绍了缓冲区溢位，它永远可能是最糟的软体安全性问题。
But the small buffer size makes it unsuitable for larger quantities of log information, and the logged information isn't stored to disk so it's hard to analyze over a period of time.
但是缓冲区尺寸小造成它不适合更大数量的日志信息，而且记录的信息不能保存到磁盘也使得难以分析一段时间内的性能。
This time, though, the data is put into a different buffer, a buffer that is associated with sockets specifically.
但是这一次放置的缓冲区不同，该缓冲区与目标套接字相关联。
The consumer of the ATQ operator can read data one row at a time from the ATQ buffer.
ATQ操作符的消费者可以每次从 ATQ缓冲区中读取一行数据。
This time, though, the data is put into a different buffer, one that is associated with the destination socket.
但是这一次放置的缓冲区不同，该缓冲区与目标套接字相关联。
The UNION operator consumes the data a row at a time from the SHIP buffer and flows the row upwards to the application through the RETURN operator.
UNION操作符每次使用SHIP缓冲区中的一行数据，并将这行数据通过RETURN 操作符上传到应用程序。
This function is available everywhere, and you should use it just about all the time; a lot of security holes have been based on buffer overruns in sprintf, and this can protect against them.
这个函数随处可用，而且您应该始终使用它；很多安全漏洞都归咎于sprintf中的缓冲区溢出，而这个函数可以预防这个问题。
Repeated opening and closing of Ambulant from the command-line interface (CLI) destroys the error buffer each time.
通过命令行界面(CLI)重复打开和关闭ambulant每次会破坏错误缓冲。
PseudoAttributeTokenizer scans the buffer one character at a time, looking for pseudo-attributes.
PseudoAttributeTokenizer 每次扫描缓冲区一个字符，查找伪属性。
The UNION operator reads data from each SHIP buffer, one buffer at a time. The sequence of operations is as follows
而UNION操作符则从每个SHIP缓冲区中读取数据，每次读取一个缓冲区。
If this includes you, now's the time to review your finances, so that you can build up this buffer.
如果您也在其中的话，现在是时候检查一下您的财务状况了，这样您可以建立自己的缓冲区。
The script can send the code to the server, have the server evaluate it, then return the results to a new buffer with an execution-time stamp.
这个脚本可以将代码发送到服务器，让服务器评估代码，然后将结果返回到一个带有执行时间戳的新缓冲区。
A ring buffer is a logging technique for applications whereby the relevant data to be logged is kept in memory instead of writing it to a file on a disk every time.
循环缓冲区是一种用于应用程序的日志记录技术，它可以将相关的数据保存在内存中，而不是每次都将其写入到磁盘上的文件中。
If you wind up having to waste a few bytes in your buffer, it is trivial compared to the amount of time and code needed to special-case the beginning and end of unaligned data.
如果您不得不在缓冲区中浪费几个字节，这种代价与处理非对齐数据的开头和结尾所需要的时间和代码量相比也是微不足道的。
The SPU is built to deal with data in batches, so moving to a buffer-at-a-time model will make the enhancements easier.
SPU的设计就是用来批量处理数据，因此转到“一次处理一个缓冲区”的模型可以简化这种改进。
There are no run-time checks that prevent writing past the end of a buffer, so a programmer has to perform the check in his or her own code, or run into problems down the road.
没有执行时检查来这一防止写入超过缓冲区末尾，所以程式员必须在其自己的程式码中执行这一检查，否则继续下去会遇到问题。
Often the real-time requirement is a tradeoff of time and buffer space.
实时的要求常常是时间和缓冲空间的折衷。
If you set the buffer pool size too high, then system memory usage will exceed the available physical memory, causing the operating system to spend more time paging the memory.
如果缓冲池大小过大，那么内存使用会超过可用的物理内存，从而导致操作花费更多时间对内存进行分页。
If you set the buffer pool size too high, then system memory usage will exceed the available physical memory, causing the operating system to spend more time paging the memory.
如果缓冲池大小过大，那么内存使用会超过可用的物理内存，从而导致操作花费更多时间对内存进行分页。
应用推荐