如果并非所有应用服务器都拥有同等的处理能力，则可使用加权最少连接算法来考虑处理能力的差异。
If all application servers do not possess equal amounts of compute power, a weighted least connections algorithm can be used to account for the difference.
首先，缓存会实现最近最少使用的算法，使得 ASP.NET能够在内存运行效率较低的情况下强制缓存清除——从缓存自动删除未使用过的项目。
The first is that the Cache implements a least-recently-used algorithm, allowing ASP.NET to force a Cache purge—automatically removing unused items from the Cache—if memory is running low.
您可能已经使用过轮询算法或使用“最少连接数”算法完成一些额外的工作然后离去，但我们想尽可能地保持简单。
You could have used a round-robin or done some extra work and gone with a "least connections" algorithm, but we wanted to keep it as simple as possible.
内存区域是一个使用最近最少算法（Least RecentlyUsed，LRU）的纯内存缓存区域。
The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
该算法与其它算法相比使用存储空间最少，却具有相似的性能，便于硬件实现。
The algorithm uses minimum storage space compared to other algorithms, but with similar performance and convenient for hardware implementation.
给出了系统划分模型，使用执行时间最少的增益函数启发下一步动作的启发算法。
The heuristic algorithm is the gain of the execution time. The partitioning model is constructed and the result is searched.
结果表明：在工件的权重和工件的平均加工时间不成比例的最一般的情况下，最短加工时间和最长加工时间优先规则的联合使用给出了使拖后工件数最少的优先策略，并对算法的最优性进行了证明。
The priority policy of joint use of the shortest expected processing time and the longest prcessing time is optimal when the expected processing time is non-proportional to the number of the jobs.
结果表明：在工件的权重和工件的平均加工时间不成比例的最一般的情况下，最短加工时间和最长加工时间优先规则的联合使用给出了使拖后工件数最少的优先策略，并对算法的最优性进行了证明。
The priority policy of joint use of the shortest expected processing time and the longest prcessing time is optimal when the expected processing time is non-proportional to the number of the jobs.
应用推荐