助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   最小连接 的翻译结果: 查询用时:0.635秒
图标索引 在分类学科中查询
所有学科
互联网技术
数学
宏观经济管理与可持续发展
更多类别查询

图标索引 历史查询
 

最小连接     
相关语句
  minimum connection
     For the facility location problem in general distance space where the maximum connection cost is at most ω>1 times the minimum connection cost, by making use of set cover problem and the method of problem reduction, it is first proved that there are no polynomial time approximation algorithms with approximation ratios smaller than 1.243+0.316ln(ω-1), unless NPDTIME(nO(log log n)), and then a (1+ω)?
     针对最大连接费用至多是最小连接费用ω>1倍的一般距离空间中设施定位问题,简称一般设施定位问题,借助集合覆盖问题,利用问题归约方法证明其不存在近似性能比小于1.243+0.316ln(ω-1)的多项式时间近似算法,除非NPDTIME(nO(loglogn));
短句来源
     Study of minimum connection based on the weighted VGC mechanism
     基于加权VGC机制的最小连接问题研究
短句来源
     By following the notions from the field of mechanism design,a framework for studying such algorithms is suggested. The standard tools of mechanism design is applied to the minimum connection problem.
     文章引用了机制设计的概念,提出了研究该算法的框架,并将机制设计的标准工具VGC机制应用于解决最小连接问题。
短句来源
  smallest connection
     The smallest connection problem is widely used in network optimization. The key of solution is to find a minimum spanning tree with rapid and effective algorithm.
     最小连接问题在网络优化中有广泛的应用,找到快速有效的算法来构造最小生成树是解决问题的关键。
短句来源
  least-connection
     Since the technology of linux virtual server is not perfect, I would like to bring forward the new algorithm for weighted least-connection scheduling which called weighted load-factor scheduling algorithm through a completed analysis for LVS dynamic load-balancing algorithm. Then I realized my idea in linux kernel so as to improve the efficiency of linux virtual server cluster system.
     但当前的Linux虚拟服务器技术并不是很完善,基于这种状况,在对其核心动态负载平衡算法进行了详尽的分析后,我对其中较常用的加权最小连接调度算法提出了改进算法----加权负载因子调度算法,并在Linux内核中实现了该算法,从而使Linux虚拟服务器集群的效率得以改进,具有较强的实用价值。
短句来源
     Experimental results show that the performance of the distributing algorithms in kernel level is much better than that in user level and ACARD can increase the average throughput of the system by 20.4% compared to weighted least-connection.
     实验表明,基于内核态的请求分发算法的性能远优于基于用户态的算法,而且在内核态下,ACARD相对加权最小连接算法的系统平均吞吐量可提高20 4%.
短句来源
     Based on LVS project,this paper provides an overall solution to Web cluster by adopting DR mode. A full dynamic intelligent weighted Least-Connection algorithms is proposed,and the validity and performance of Web cluster is tested.
     基于LVS项目,给出了采用DR模式的Web集群解决方案,针对LVS自带的加权最小连接数算法的权值不能反映服务器实时负载能力,提出并实现了全动态智能加权最小连接数算法,测试了该算法的实际使用性能。
短句来源
  “最小连接”译为未确定词的双语例句
     When the copper foil is 0.3 mm thick,the residual stress of joints reaches the minimum,resulting in the maximum joint strength.
     当铜片厚度为0.3 mm时,连接试样残余应力最小,连接强度最高。
短句来源
     When the copper foil is 0.3 mm thick, the residual stress of joints reaches the minimum, resulting in the maximum joint strength.
     当铜片厚度为0.3 mm时,连接试样残余应力最小,连接强度最高。
     The virtual backbone consists of minimum connected dominating set (MCDS).
     虚拟骨干网可以由近似的最小连接主节点集(MCDS)组成.
短句来源
     Design of Forecasting Least Connections First Scheduling Algorithm in Clustered Web Servers
     集群Web服务器的预测最小连接请求调度算法设计
短句来源
     Furthermore, we present a locality-based least connection (LBLC) scheduling algorithm, which is toimprove the access locality on individual server when load on the servers is basically balanced.
     并提出基于局部性最小连接(LBLC)调度算法,在服务器间负载基本平衡情况下,提高单个服务器的访问局部性。
短句来源
更多       
查询“最小连接”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  minimum connection
Also, minimum connection forces may exceed structural forces due to wind in some structures.
      
Also, minimum connection forces may exceed structural forces due to wind in additional structures.
      
Lastly, the minimum connection forces specified for Seismic Design Category A must be satisfied.
      
The minimum connection forces specified for Seismic Design Category A also must be satisfied.
      
  least-connection
A variable weighted least-connection algorithm for multimedia transmission
      
Among existing scheduling algorithms, round-Robin and least-connection do not take into account the difference of service capability of each node and improved algorithms such as weighted round-Robin and weighted least-connection.
      
In this paper we introduce our attempts in improving the scheduling algorithms and propose a variable weighted least-connection algorithm, which assigns variable weight, instead of fixed weight, to each node according to its real time resource.
      


Aim To improve the query processing of heterogeneous distributed database. Methods An approach were explored to get join and semijoin sequences which mini- mize the amount of data transmission required for heterogeneous distributed query pro- cessing. The algorithm selected the most hopeful node as next expended node in a search space through using a lot of heuristic rules, which minimized the amount of node searched. Results An important concept was proposed which occur with the use of join operations as reducers...

Aim To improve the query processing of heterogeneous distributed database. Methods An approach were explored to get join and semijoin sequences which mini- mize the amount of data transmission required for heterogeneous distributed query pro- cessing. The algorithm selected the most hopeful node as next expended node in a search space through using a lot of heuristic rules, which minimized the amount of node searched. Results An important concept was proposed which occur with the use of join operations as reducers in query processing, namely, useful semijoin. Some nonprofitable semijoin, though not profitable in themselves, become profitable owing to the use of subsequent join operations. Conclusion This method can improve the que- ry processing distributed database, specially on WAN.

目的提高异构分布式数据库的直询处理速度.方法提出了一个求异构分布式数据库查询处理中,使网上数据传输量达到最小的连接与半连接执行序列的启发式算法.该算法通过一个系列启发式规则,在搜索空间中,选择最有希望的节点作为下一个被扩展的节点,以减少搜索的节点数.结果提出了有用半连接的概念,虽然有的半连接就其本身讲是无益的,但是与一系列连接结合起来使用却是有益的,结论该方法能提高分布式数据库的查询处理速度,尤其在广域网上效果更为明显.

The smallest connection problem is widely used in network optimization.The key of solution is to find a minimum spanning tree with rapid and effective algorithm.This paper presents a new algorithm to construct minimum spanning tree.The store structure and the sort technique are optimized in this algorithm.Theoretical analysis and experiment results show the algorithm has less computational complexity.

最小连接问题在网络优化中有广泛的应用,找到快速有效的算法来构造最小生成树是解决问题的关键。该文提出了一种构造算法,在存储结构和排序方法两方面进行了改进。从理论上分析了算法的计算复杂度,并实际测试了算法运行时间。结果表明该算法较现有算法有了很大提高。

A few request dispatching algorithms are discussed. To the problem of that these request dispatching algorithms are based on current status of queue, a new scheduling algorithm is proposed which is called forecasting least connections first scheduling algorithm. It forecasts the future status of queue by velocity of request,load of servers and historical information of queue, then dispatch request according to the future status of queue. It can effectively solve the load imbalance problem among the servers.

讨论了集群Web服务器的几种请求调度策略 ,针对现有的请求调度策略都是基于队列当前状态的调度 ,提出“预测最小连接优先”请求调度策略 .通过请求速率、服务器负载及队列的历史信息来预测未来队列的状态 ,然后根据预测队列的状态分配请求连接 ,从而有效地解决服务器间的负载不平衡

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关最小连接的内容
在知识搜索中查有关最小连接的内容
在数字搜索中查有关最小连接的内容
在概念知识元中查有关最小连接的内容
在学术趋势中查有关最小连接的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社