Indicates the last access time for this storage stream or byte array.
指示此存储、流或字节数组的上次访问时间。
Specifies the last access time for this storage, stream, or byte array.
指定此存储、流或字节数组的上次访问时间。
Developers should modularize, optimize, and index the requests to reduce access time.
开发人员应该模块化、最优化和索引化请求，以便减少访问时间。
Developers should modularize optimize and index the requests to reduce access time.
开发人员应该模块化、最优化和索引化请求，以便减少访问时间。
After applying the computations, the estimated data access time works out to be ~ 47 ms.
在进行计算之后，估计的数据访问时间算出来约为47ms。
Besides the field access time tests, I did the same sort of timing test for method calls.
除了字段接入时间测试之外，我还进行了相同的方法调用时间测试。
Given the optimal execution time, reducing access time is another concern for developers.
如果给定最佳的执行时间，则减少访问时间是开发人员需要关心的另一个问题。
Is the pointer to the ASCII filename of the file whose access time needs to be modified.
是一个指向要修改访问时间的文件的ASCII文件名的指针。
Given the optimal execution time reducing access time is another concern for developers.
如果给定最佳的执行时间，则减少访问时间是开发人员需要关心的另一个问题。
The two nulls indicate that we do not want to change the last access time or creation time for this file.
这两个null指出，我们不想改变这一文件的最后访问时间或者创建时间。
Unless you measure carefully, you don't know the true average access time or throughput of your disk subsystems.
除非您仔细检查，否则您无法知道磁盘子系统实际的平均存取时间或吞吐量。
With this model, you can simulate the effects a higher near-cache hit will have on the average data access time.
使用这个模型，您可以对较高近距离缓存命中率对平均数据访问时间造成的影响进行模拟。
IT related parental demandingness in terms of controlling youths access time on using computers was very low.
家长在限制青少年使用电脑的时间这方面的要求不高。
The effect of increasing the probability of a cache hit in the near cache is a 42% improvement in data access time.
近缓存中缓存命中率逐渐增加，其效果是数据访问时间提高了 42%。
The simulation results show that this replication strategy can reduce the average data access time efficiently.
模拟实验的结果显示此副本创建策略可以有效降低数据平均访问时间。
As a result, the disk access time is much longer when reading data in random order than when reading in sequential order.
因此，与按顺序读取相比，按随机顺序读取数据时的磁盘访问时间要长得多。
The idea is to make this class as easy as possible to use, while making it efficient in terms of memory and access time.
这一想法使得这个类尽可能易用，同时在内存和访问时间上也保证了高效。
Thee access time is often used by system adminstrators to delete files that have not been accessed for a certain amount of time.
访问时间通常是用于系统管理员删除长时间没访问过的文件的。
We include and maintain usage metrics (creation time, last access time, etc.) in the underlying database containing the calculator state.
我们在包含计算器状态的底层数据库中包括和维护使用的标准（创建时间、最近访问时间，等等）。
The atime is the last access time of a file, and each time a file is accessed, the underlying file system must record this timestamp.
atime是最近访问文件的时间，每当访问文件时，底层文件系统必须记录这个时间戳。
Any change to the last access time of files in the watched directory or subtree causes a change notification wait operation to return.
任何改变文件最近访问时间，都会查看所在目录或子目录的变更，并将结果通知给等待操作返回。
The large graphic files, in uncompressed format, can consume enormous disk space and the amount of bandwidth, thus slowing down access time.
大的未压缩格式的图形文件可以消耗掉大量的磁盘空间和带宽量，从而延缓了访问时间。
The access time is important for the system chip with high performance, the low power has been the spotlight and challenge in VLSI design.
高性能的系统芯片对数据存取速度有了更严格的要求，同时低功耗设计已成为VLSI的研究热点和挑战。
An important of data broadcast is how to schedule the broadcast data in order to optimize the access time and tuning time of the broadcast.
数据广播的一个首要问题是如何调度待广播的数据，优化数据广播的访问时间和调谐时间。
The cache can easily scale to 40 GB, which can be spread across multiple machines, so the whole cache can be in memory, with minimal access time.
缓存可以轻松扩展到40GB，可在多台机器上分布，因此整个缓存可以位于内存中，只需要很少的访问时间。
To reduce the average access time of queries and provide maximal requests, a novel scheduling strategy for multi-item broadcast is proposed.
为减少用户的平均访问时间和响应最多事务请求，提出了一种新的多数据项广播调度策略。
As you probably know, UNIX systems record an atime, or access time, for each object on the filesystem that gets updated every time a file is read.
您可能知道，UNIX系统为文件系统上的每一个对象记录一个atime，或称为访问时间，每次读取文件时，atime都会被更新。
To compute the data access time, you need to know the probabilities for the data existing in the near-cache, in the server cache, and in the database.
要计算数据访问时间，您需要了解数据存在于近缓存中、服务器缓存中、以及数据库中的概率。
Memory is the best persistent store for a cache because access time is (practically) instantaneous and RAM is typically plentiful (or cheap to amass).
内存是缓存的最佳持久性存储，因为访问时间(实际上)是即时的并且RAM的容量通常都很大(或者容易聚集在一起)。
Figure 15. Increasing the probability of a near-cache hit, either through larger near caches or affinity routing, reduces the average data access time.
图15.通过较大近缓存或者关联路由，逐渐增加近缓存命中的概率，可以减少平均数据访问时间。
应用推荐